Two arc disjoint paths in eulerian digraphs

A. Frank, Toshihide Ibaraki, Hiroshi Nagamochi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Let G be an Eulerian digraph, and {x1,x2}, {y1,y2} be two pairs of vertices in G. An instance (G; {x1, x2}, {y1, Y2}) is called feasible if it contains two arc-disjoint x'x"- and y'y"- paths, where {x',x'} = {x1,x2} and {y',y"} = {Yx,Y2}. An O(m + nlogn) time algorithm is presented to decide whether G is feasible, where n and m are the number of vertices and arcs in G, respectively. The algorithm is based on a structural characterization of minimal infeasible instances.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages92-101
Number of pages10
Volume1004
ISBN (Print)3540605738, 9783540605737
Publication statusPublished - 1995
Event6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia
Duration: Dec 4 1995Dec 6 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1004
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Symposium on Algorithms and Computations, ISAAC 1995
CountryAustralia
CityCairns
Period12/4/9512/6/95

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Two arc disjoint paths in eulerian digraphs'. Together they form a unique fingerprint.

  • Cite this

    Frank, A., Ibaraki, T., & Nagamochi, H. (1995). Two arc disjoint paths in eulerian digraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1004, pp. 92-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1004). Springer Verlag.