### Abstract

Let G be an Eulerian digraph, and {x_{1},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"} = {Yx,Y_{2}}. 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 92-101 |

Number of pages | 10 |

Volume | 1004 |

ISBN (Print) | 3540605738, 9783540605737 |

Publication status | Published - 1995 |

Event | 6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia Duration: Dec 4 1995 → Dec 6 1995 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1004 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 6th International Symposium on Algorithms and Computations, ISAAC 1995 |
---|---|

Country | Australia |

City | Cairns |

Period | 12/4/95 → 12/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.