A Polynomial Solution to the Undirected Two Paths Problem
Open Access
- 1 July 1980
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (3) , 445-456
- https://doi.org/10.1145/322203.322207
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a GraphJournal of the ACM, 1978
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- On the existence of certain disjoint arcs in graphsDuke Mathematical Journal, 1968