Skip to main content
Conference ProceedingsOPEN ACCESS

The two disjoint path problem and wire routing design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 108 LNCS 207-216
DOI: 10.1007/3-540-10704-5_18
23Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new polynomial time algorithm is presented for finding two vertex-disjoint paths between two specified pairs of vertices on an undirected graph. An application of the two disjoint path algorithm to the automatic wire routing is also discussed.

Cite

CITATION STYLE

APA

Ohtsuki, T. (1981). The two disjoint path problem and wire routing design. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 108 LNCS, pp. 207–216). Springer Verlag. https://doi.org/10.1007/3-540-10704-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free