Name
Abstract | ||
|---|---|---|
In 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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11576235_50 | ISPA |
Keywords | Field | DocType |
average performance,burnt pancake graph,polynomial time algorithm,polynomial order time,computer experiment,n-burnt pancake graph,time complexity,disjoint path,paths length,container problem | Graph theory,Graph,Computer experiment,Discrete mathematics,Combinatorics,Disjoint sets,Polynomial,Correctness,Ordered graph,Time complexity,Mathematics,Distributed computing | Conference |
Volume | ISSN | ISBN |
3758 | 0302-9743 | 3-540-29769-3 |
Citations | PageRank | References |
2 | 0.40 | 18 |
Authors | ||
3 | ||