An Algorithm for Node-Disjoint Paths in Pancake Graphs
Summary :
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n-1 internally disjoint paths 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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.3 pp.610-615
- Publication Date
- 2003/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasuto SUZUKI, Keiichi KANEKO, "An Algorithm for Node-Disjoint Paths in Pancake Graphs" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 3, pp. 610-615, March 2003, doi: .
Abstract: For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n-1 internally disjoint paths 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_3_610/_p
Copy
@ARTICLE{e86-d_3_610,
author={Yasuto SUZUKI, Keiichi KANEKO, },
journal={IEICE TRANSACTIONS on Information},
title={An Algorithm for Node-Disjoint Paths in Pancake Graphs},
year={2003},
volume={E86-D},
number={3},
pages={610-615},
abstract={For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n-1 internally disjoint paths 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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Algorithm for Node-Disjoint Paths in Pancake Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 610
EP - 615
AU - Yasuto SUZUKI
AU - Keiichi KANEKO
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2003
AB - For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n-1 internally disjoint paths 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.
ER -
English
