An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
-
- NAKAYAMA Shin-ichi
- the Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, The University of Tokushima
-
- MASUYAMA Shigeru
- the Department of Knowledge-Based Information Engineering, Toyohashi University of Technology
この論文をさがす
抄録
This paper presents an O(n^2)-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^4)-time algorithm.
収録刊行物
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences 83 (12), 2672-2678, 2000-12-01
一般社団法人電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1570291227426560512
-
- NII論文ID
- 110003208518
-
- NII書誌ID
- AA10826239
-
- ISSN
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles