{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:31:30Z","timestamp":1648949490189},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01190896","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T06:57:59Z","timestamp":1108709879000},"page":"199-216","source":"Crossref","is-referenced-by-count":1,"title":["A linear algorithm for the all-bidirectional-edges problem on planar graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"P. B.","family":"Ramprasad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Technical Report","author":"D. Brand","year":"1983","unstructured":"Brand, D., Detecting Sneak Paths in Transistor Networks, Technical Report, IBM Thomas J. Watson Research Centre, Yorktown Heights, NY, 1983."},{"key":"CR2","unstructured":"Frank, E., A Data Driven Multiprocessor for Switch Level Simulation of VLSI Circuits, Ph.D. Thesis, Carnegie-Mellon University, 1984."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., and Tarjan, R. E., Dividing a graph into triconnected components,SIAM J. Comput.,2 (1973), 135?158.","journal-title":"SIAM J. Comput."},{"key":"CR4","unstructured":"Mishra, B., Some Graph Theoretic Issues in VLSI Design, Ph.D. Thesis, Carnegie-Mellon University, September 1985."},{"key":"CR5","unstructured":"Pandu Rangan, C., and Ramprasad, P. B., A new linear algorithm for the two path problem on planar graphs, (submitted for publication)."},{"key":"CR6","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,J. Assoc. Comput. Mach.,25 (1978), 1?9.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P. D. Seymour","year":"1980","unstructured":"Seymour, P. D., Disjoint paths in graphs,Discrete Math.,29 (1980), 293?309.","journal-title":"Discrete Math."},{"key":"CR8","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,J. Assoc. Comput. Mach.,27 (1980), 445?456.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR9","first-page":"337","volume-title":"Combinatorics for Computer Science","author":"S. G. Williamson","year":"1985","unstructured":"Williamson, S. G.,Combinatorics for Computer Science, Computer Science Press, Rockville, MD, 1985, pp. 337?338."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190896.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190896\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:08:25Z","timestamp":1556615305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01190896"],"URL":"https:\/\/doi.org\/10.1007\/bf01190896","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}