The two disjoint path problem and wire routing design
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 207-216
- https://doi.org/10.1007/3-540-10704-5_18
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- PC Board Layout TechniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a GraphJournal of the ACM, 1978
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- The equivalence of theorem proving and the interconnection problemACM SIGDA Newsletter, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961