Container problem in burnt pancake graphs

Authors:
N. Sawada;Y. Suzuki;K. Kaneko
Affiliations:
Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Tokyo, Japan;Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Tokyo, Japan;Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 10
Cited 0

The cosmic cube

Communications of the ACM - Special section on computer architecture
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks

Information Processing Letters
Optimal Information Dissemination in Star and Pancake Networks

IEEE Transactions on Parallel and Distributed Systems
Node-to-set disjoint paths problem in star graphs

Information Processing Letters
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
Parallel Routing and Sorting of the Pancake Network

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks

CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
Embedding hypercubes into pancake, cycle prefix and substring reversal networks

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.