{"main_file_link":[{"url":"https://doi.org/10.1006/jcss.1997.1493","open_access":"1"}],"publisher":"Elsevier","oa_version":"Published Version","language":[{"iso":"eng"}],"publication":"Journal of Computer and System Sciences","page":"3-23","day":"01","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Klein, Philip","last_name":"Klein","first_name":"Philip"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"first_name":"Sairam","last_name":"Subramanian","full_name":"Subramanian, Sairam"}],"publication_identifier":{"issn":["0022-0000"]},"extern":"1","article_type":"original","article_processing_charge":"No","year":"1997","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we give an algorithm requiringO(n4/3 log(nL)) time, whereLis the absolute value of the most negative length. This algorithm can be used to obtain similar bounds for computing a feasible flow in a planar network, for finding a perfect matching in a planar bipartite graph, and for finding a maximum flow in a planar graph when the source and sink are not on the same face. We also give parallel and dynamic versions of these algorithms.","lang":"eng"}],"publication_status":"published","status":"public","quality_controlled":"1","issue":"1","volume":55,"_id":"11767","citation":{"apa":"Henzinger, M. H., Klein, P., Rao, S., &#38; Subramanian, S. (1997). Faster shortest-path algorithms for planar graphs. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1006/jcss.1997.1493\">https://doi.org/10.1006/jcss.1997.1493</a>","short":"M.H. Henzinger, P. Klein, S. Rao, S. Subramanian, Journal of Computer and System Sciences 55 (1997) 3–23.","ista":"Henzinger MH, Klein P, Rao S, Subramanian S. 1997. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. 55(1), 3–23.","chicago":"Henzinger, Monika H, Philip Klein, Satish Rao, and Sairam Subramanian. “Faster Shortest-Path Algorithms for Planar Graphs.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1006/jcss.1997.1493\">https://doi.org/10.1006/jcss.1997.1493</a>.","ieee":"M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” <i>Journal of Computer and System Sciences</i>, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.","mla":"Henzinger, Monika H., et al. “Faster Shortest-Path Algorithms for Planar Graphs.” <i>Journal of Computer and System Sciences</i>, vol. 55, no. 1, Elsevier, 1997, pp. 3–23, doi:<a href=\"https://doi.org/10.1006/jcss.1997.1493\">10.1006/jcss.1997.1493</a>.","ama":"Henzinger MH, Klein P, Rao S, Subramanian S. Faster shortest-path algorithms for planar graphs. <i>Journal of Computer and System Sciences</i>. 1997;55(1):3-23. doi:<a href=\"https://doi.org/10.1006/jcss.1997.1493\">10.1006/jcss.1997.1493</a>"},"date_published":"1997-08-01T00:00:00Z","title":"Faster shortest-path algorithms for planar graphs","scopus_import":"1","oa":1,"doi":"10.1006/jcss.1997.1493","type":"journal_article","date_created":"2022-08-08T12:28:45Z","date_updated":"2022-09-12T10:46:21Z","month":"08","intvolume":"        55"}