Abstract

AbstractIn this paper, we propose an algorithm that solves the container problem in n-burnt pancake graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of paths lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm. burnt pancake graphs, container problem, internally disjoint paths, polynomial time algorithm.Keywordsburnt pancake graphscontainer probleminternally disjoint pathspolynomial time algorithm

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call