The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam makalah ini, kami memberikan algoritma untuk masalah laluan berpisah nod-untuk-set dalam graf pemutar dengan keputusan penilaiannya. Algoritma adalah berdasarkan rekursi dan ia dibahagikan kepada kes mengikut taburan nod destinasi dalam kelas di mana semua nod dalam graf pemutar dikategorikan. Jumlah panjang laluan yang diperoleh dan kerumitan masa algoritma dianggarkan dan disahkan oleh simulasi komputer.
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.
Salinan
Keiichi KANEKO, Yasuto SUZUKI, "An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 9, pp. 1155-1163, September 2001, doi: .
Abstract: In this paper, we give an algorithm for the node-to-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are estimated and verified by computer simulation.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_9_1155/_p
Salinan
@ARTICLE{e84-d_9_1155,
author={Keiichi KANEKO, Yasuto SUZUKI, },
journal={IEICE TRANSACTIONS on Information},
title={An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs},
year={2001},
volume={E84-D},
number={9},
pages={1155-1163},
abstract={In this paper, we give an algorithm for the node-to-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are estimated and verified by computer simulation.},
keywords={},
doi={},
ISSN={},
month={September},}
Salinan
TY - JOUR
TI - An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 1155
EP - 1163
AU - Keiichi KANEKO
AU - Yasuto SUZUKI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2001
AB - In this paper, we give an algorithm for the node-to-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are estimated and verified by computer simulation.
ER -