{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:43Z","timestamp":1725663283846},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540505174"},{"type":"electronic","value":"9783540460305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50517-2_70","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:27:12Z","timestamp":1330201632000},"page":"49-66","source":"Crossref","is-referenced-by-count":2,"title":["A new linear algorithm for the two path problem on chordal graphs"],"prefix":"10.1007","author":[{"given":"S. V.","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]},{"given":"S.","family":"Seshadri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","unstructured":"Ebert,J., A Linear Disjoint Path Algorithm, Proceedings WG82, Munich: Hanser Verlag (1982) 37\u201345."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Golumbic,M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"4_CR3","first-page":"207","volume":"108","author":"T. Ohtsuki","year":"1980","unstructured":"Ohtsuki, T., The two disjoint path problem and wire routing design, Graph Theory and Algorithms (Eds. Saito,N. and Nishizeki,T.) Springer 108 (1980) 207\u2013216.","journal-title":"Springer"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y. and Shiloach, Y., Finding two disjoint paths between two pairs of vertices in a graph, Journal of ACM, 25 (1978) 1\u20139.","journal-title":"Journal of ACM"},{"key":"4_CR5","unstructured":"Ramprasad,P.B. and Pandu Rangan,C., A new linear algorithm for the two path problem on planar graphs (To appear)."},{"key":"4_CR6","doi-asserted-by":"crossref","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 path problem, Journal of ACM, 27 (1980) 445\u2013456.","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50517-2_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:18Z","timestamp":1605647898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50517-2_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540505174","9783540460305"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-50517-2_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}