{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:28Z","timestamp":1725664168906},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_183","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:42:58Z","timestamp":1330270978000},"page":"208-216","source":"Crossref","is-referenced-by-count":0,"title":["Edge-disjoint paths in permutation graphs"],"prefix":"10.1007","author":[{"given":"C. P.","family":"Gopalakrishnan","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"25_CR1","unstructured":"K. Arvind, V. Kamakoti, C. Pandu Rangan, Efficient Parallel Algorithms for Permutation Graphs, to appear in Journal of Parallel and Distributed Computing."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"C.P. Gopalakrishnan, C. Pandu Rangan, A linear algorithm for the two paths problem on permutation graphs, submitted to Discussiones Mathematicae.","DOI":"10.7151\/dmgt.1013"},{"key":"25_CR4","volume-title":"Technical report, 2\/91","author":"S.V. Krishnan","year":"1991","unstructured":"S.V. Krishnan, C. Pandu Rangan, S. Seshadri, A. Schwill, Two Disjoint Paths in Chordal graphs, Technical report, 2\/91, February 1991, University of Oldenburg, Germany."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"A. LaPaugh, R.L. Rivest, The subgraph homeomorphism problem, Proc. of the 10th STOC (1978) 40\u201350.","DOI":"10.1145\/800133.804330"},{"key":"25_CR6","unstructured":"T. Ohtsuki, The two disjoint path problem and wire routing design, In Proc. of the 17th Symp. of Res. Inst. of Electrical Comm. (1980) 257\u2013267."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"A. Schwill, Nonblocking graphs: Greedy algorithms to compute disjoint paths, Proc. of the 7th STACS (1990) 250\u2013262.","DOI":"10.1007\/3-540-52282-4_48"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Y. Shiloach, A polynomial solution to the undirected two paths problem, J. of the ACM 27 (1980) 445\u2013456.","journal-title":"J. of the ACM"},{"key":"25_CR9","first-page":"182","volume":"31","author":"A. Srinivasa Rao","year":"1991","unstructured":"A. Srinivasa Rao, C. Pandu Rangan, Linear algorithms for parity path and two path problems on circular arc graphs, BIT Vol 31 (1991) 182\u2013193.","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_183.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:29Z","timestamp":1605647969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_183","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}