{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:08Z","timestamp":1725497168365},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_14","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"145-150","source":"Crossref","is-referenced-by-count":1,"title":["A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Torben","family":"Hagerup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci.\u00a010, 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading, Mass (1969)"},{"key":"14_CR3","first-page":"129","volume-title":"Advances in Computing Research","author":"M.R. Kramer","year":"1984","unstructured":"Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) Advances in Computing Research, vol.\u00a02, pp. 129\u2013146. JAI Press, Greenwich, Conn (1984)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1061425.1061430","volume":"5","author":"J.F. Lynch","year":"1975","unstructured":"Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. ACM SIGDA Newsletter\u00a05, 31\u201336 (1975)","journal-title":"ACM SIGDA Newsletter"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0129054100000247","volume":"11","author":"L. Perkovi\u0107","year":"2000","unstructured":"Perkovi\u0107, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. Internat. J. Foundat. Comput. Sci.\u00a011, 365\u2013371 (2000)","journal-title":"Internat. J. Foundat. Comput. Sci."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM\u00a025, 1\u20139 (1978)","journal-title":"J. ACM"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B\u00a063, 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A. Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM J. Comput.\u00a023, 780\u2013788 (1994)","journal-title":"SIAM J. Comput."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. ACM\u00a027, 445\u2013456 (1980)","journal-title":"J. ACM"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00224-005-1256-9","volume":"39","author":"T. Tholey","year":"2006","unstructured":"Tholey, T.: Solving the 2-disjoint paths problem in nearly linear time. Theory Comput. Systems\u00a039, 51\u201378 (2006)","journal-title":"Theory Comput. Systems"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(90)90071-5","volume":"36","author":"G. Woeginger","year":"1990","unstructured":"Woeginger, G.: A simple solution to the two paths problem in planar graphs. Inform. Process. Lett.\u00a036, 191\u2013192 (1990)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:30Z","timestamp":1619520150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_14","relation":{},"subject":[]}}