An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2000-12-25
著者
-
Masuyama Shigeru
The Department Of Knowledge-based Information Engineering Toyohashi University Of Technology
-
NAKAYAMA Shin-ichi
The Department of Mathematical Science, Faculty of Integral Arts and Science, The University of Toku
-
Nakayama Shin-ichi
The Department Of Mathematical Science Faculty Of Integral Arts And Science The University Of Tokush
-
Nakayama Shin-ichi
The Department Of Mathematical Sciences Faculty Of Integrated Arts And Sciences The University Of To
-
Nakayama S
the Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, The University of Tokushima
-
Masuyama S
the Department of Knowledge-Based Information Engineering, Toyohashi University of Technology
関連論文
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph
- Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph
- What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? : Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples(Special Issue on Algorithm Engineering : Surveys)
- An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
- Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph(Special Section on Discrete Mathematics and Its Applications)