Presentation 1995/9/22
Finding Two Arc Disjoint Paths in Eulerian Digraphs
Andras FRANK, Toshihide IBARAKI, Hitoshi NAGAMOCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let G be an Eulerian digraph, and {x1,x_2},{y_1,y_2} be two pairs of vertices in G. An instance (G;{x_1,x_2},{y_1,y_2}) is called feasible if it contains two arc-disjoint x'x"- and y'y"- paths, where {x',x"} = {x_1,x_2} and {y',y"} = {y_1,y_2}. This paper shows that any infeasible instance can be reduced to a minimal infeasible instance, which has a planar reparesentation that indicates its infeasibility. Based on this structural characterization, we can check if a given instance is feasible or not in o(m + nlogn) time, and find a feasible solution in o(m(m+nlogn))time(if the instance is feasible), where m and n are the numbers of edges and vertices in G, respectively
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Eulerian digraph / disjoint paths / planar graph / polynomial time algorithm
Paper # COMP95-45
Date of Issue

Conference Information
Committee COMP
Conference Date 1995/9/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finding Two Arc Disjoint Paths in Eulerian Digraphs
Sub Title (in English)
Keyword(1) Eulerian digraph
Keyword(2) disjoint paths
Keyword(3) planar graph
Keyword(4) polynomial time algorithm
1st Author's Name Andras FRANK
1st Author's Affiliation Dept.of Computer Science, Mathematical Institute,()
2nd Author's Name Toshihide IBARAKI
2nd Author's Affiliation Dept.of Applied Mathematics and Physics, Kyoto University,
3rd Author's Name Hitoshi NAGAMOCHI
3rd Author's Affiliation Dept.of Applied Mathematics and Physics, Kyoto University,
Date 1995/9/22
Paper # COMP95-45
Volume (vol) vol.95
Number (no) 259
Page pp.pp.-
#Pages 10
Date of Issue