An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments

Shin-ichi NAKAYAMA; Shigeru MASUYAMA

Copy

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(n²)-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(n⁴)-time algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_12_2672/_p

Copy

@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(n²)-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(n⁴)-time algorithm.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

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(n²)-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(n⁴)-time algorithm.
ER -