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
Kertas kerja ini membentangkan satu O(n2Algoritma )-masa untuk membina dua laluan tepi-pecah yang menghubungkan dua pasang bucu yang diberikan dalam graf kejohanan tertentu. Ia meningkatkan kerumitan masa yang diketahui sebelum ini O(n4)-algoritma masa.
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
Shin-ichi NAKAYAMA, Shigeru MASUYAMA, "An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 12, pp. 2672-2678, December 2000, doi: .
Abstract: This paper presents an O(n2)-time algorithm for constructing two edge-disjoint paths connecting two given pairs of vertices in a given tournament graph. It improves the time complexity of a previously known O(n4)-time algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_12_2672/_p
Salinan
@ARTICLE{e83-a_12_2672,
author={Shin-ichi NAKAYAMA, Shigeru MASUYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments},
year={2000},
volume={E83-A},
number={12},
pages={2672-2678},
abstract={This paper presents an O(n2)-time algorithm for constructing two edge-disjoint paths connecting two given pairs of vertices in a given tournament graph. It improves the time complexity of a previously known O(n4)-time algorithm.},
keywords={},
doi={},
ISSN={},
month={December},}
Salinan
TY - JOUR
TI - An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2672
EP - 2678
AU - Shin-ichi NAKAYAMA
AU - Shigeru MASUYAMA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2000
AB - This paper presents an O(n2)-time algorithm for constructing two edge-disjoint paths connecting two given pairs of vertices in a given tournament graph. It improves the time complexity of a previously known O(n4)-time algorithm.
ER -