In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-burnt pancake graphs in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of t...
详细信息
In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-burnt pancake graphs in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n(3)) and the maximum path length 3n + 4. We conducted a computer experiment for n = 2 to 100 to measure the average performance of our algorithm. The results show that the average time complexity is O(n(3.0)) and the maximum path length is 3n + 4.
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n - 1 internally disjointpaths connecting the nodes in the time complexity of polynomial order of n. The length of each p...
详细信息
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n - 1 internally disjointpaths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation.
暂无评论