Two arc-disjoint paths in Eulerian digraphs

A. Frank, Toshihide Ibaraki, Hiroshi Nagamochi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Let G bean Eulerian digraph, and let {x1,x2}, {y1, y2} be two pairs of vertices in G. A directed path from a vertex s to a vertex t is called an st-path. An instance (G; {x1, x2}, {y1, y2}) is called feasible if there is a choice of h,i,j,k with {h,i} = {j,k} = {1,2} such that G has two arc-disjoint XhXi- and yjyk-paths. In this paper, we characterize the structure of minimal infeasible instances, based on which an O(m + n log n) time algorithm is presented to decide whether a given instance is feasible, where n and m are the number of vertices and arcs in the instance, respectively. If the instance is feasible, the corresponding two arc-disjoint paths can be computed in O(m(m + n log n)) time.

Original languageEnglish
Pages (from-to)557-589
Number of pages33
JournalSIAM Journal on Discrete Mathematics
Volume11
Issue number4
Publication statusPublished - Nov 1998

Fingerprint

Disjoint Paths
Digraph
Arc of a curve
Path
Bean
Vertex of a graph
Disjoint

Keywords

  • Disjoint paths
  • Eulerian digraph
  • Minimum cut
  • Planar graph
  • Polynomial time algorithm

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Frank, A., Ibaraki, T., & Nagamochi, H. (1998). Two arc-disjoint paths in Eulerian digraphs. SIAM Journal on Discrete Mathematics, 11(4), 557-589.

Two arc-disjoint paths in Eulerian digraphs. / Frank, A.; Ibaraki, Toshihide; Nagamochi, Hiroshi.

In: SIAM Journal on Discrete Mathematics, Vol. 11, No. 4, 11.1998, p. 557-589.

Research output: Contribution to journalArticle

Frank, A, Ibaraki, T & Nagamochi, H 1998, 'Two arc-disjoint paths in Eulerian digraphs', SIAM Journal on Discrete Mathematics, vol. 11, no. 4, pp. 557-589.
Frank, A. ; Ibaraki, Toshihide ; Nagamochi, Hiroshi. / Two arc-disjoint paths in Eulerian digraphs. In: SIAM Journal on Discrete Mathematics. 1998 ; Vol. 11, No. 4. pp. 557-589.
@article{ee4a2ad5dfa34010be12d158988a02ee,
title = "Two arc-disjoint paths in Eulerian digraphs",
abstract = "Let G bean Eulerian digraph, and let {x1,x2}, {y1, y2} be two pairs of vertices in G. A directed path from a vertex s to a vertex t is called an st-path. An instance (G; {x1, x2}, {y1, y2}) is called feasible if there is a choice of h,i,j,k with {h,i} = {j,k} = {1,2} such that G has two arc-disjoint XhXi- and yjyk-paths. In this paper, we characterize the structure of minimal infeasible instances, based on which an O(m + n log n) time algorithm is presented to decide whether a given instance is feasible, where n and m are the number of vertices and arcs in the instance, respectively. If the instance is feasible, the corresponding two arc-disjoint paths can be computed in O(m(m + n log n)) time.",
keywords = "Disjoint paths, Eulerian digraph, Minimum cut, Planar graph, Polynomial time algorithm",
author = "A. Frank and Toshihide Ibaraki and Hiroshi Nagamochi",
year = "1998",
month = "11",
language = "English",
volume = "11",
pages = "557--589",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Two arc-disjoint paths in Eulerian digraphs

AU - Frank, A.

AU - Ibaraki, Toshihide

AU - Nagamochi, Hiroshi

PY - 1998/11

Y1 - 1998/11

N2 - Let G bean Eulerian digraph, and let {x1,x2}, {y1, y2} be two pairs of vertices in G. A directed path from a vertex s to a vertex t is called an st-path. An instance (G; {x1, x2}, {y1, y2}) is called feasible if there is a choice of h,i,j,k with {h,i} = {j,k} = {1,2} such that G has two arc-disjoint XhXi- and yjyk-paths. In this paper, we characterize the structure of minimal infeasible instances, based on which an O(m + n log n) time algorithm is presented to decide whether a given instance is feasible, where n and m are the number of vertices and arcs in the instance, respectively. If the instance is feasible, the corresponding two arc-disjoint paths can be computed in O(m(m + n log n)) time.

AB - Let G bean Eulerian digraph, and let {x1,x2}, {y1, y2} be two pairs of vertices in G. A directed path from a vertex s to a vertex t is called an st-path. An instance (G; {x1, x2}, {y1, y2}) is called feasible if there is a choice of h,i,j,k with {h,i} = {j,k} = {1,2} such that G has two arc-disjoint XhXi- and yjyk-paths. In this paper, we characterize the structure of minimal infeasible instances, based on which an O(m + n log n) time algorithm is presented to decide whether a given instance is feasible, where n and m are the number of vertices and arcs in the instance, respectively. If the instance is feasible, the corresponding two arc-disjoint paths can be computed in O(m(m + n log n)) time.

KW - Disjoint paths

KW - Eulerian digraph

KW - Minimum cut

KW - Planar graph

KW - Polynomial time algorithm

UR - http://www.scopus.com/inward/record.url?scp=11744320271&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11744320271&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:11744320271

VL - 11

SP - 557

EP - 589

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 4

ER -