{"id":"https://openalex.org/W2762935521","doi":"https://doi.org/10.1006/jcss.1997.1493","title":"Faster Shortest-Path Algorithms for Planar Graphs","display_name":"Faster Shortest-Path Algorithms for Planar Graphs","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2762935521","doi":"https://doi.org/10.1006/jcss.1997.1493","mag":"2762935521"},"language":"en","primary_location":{"id":"doi:10.1006/jcss.1997.1493","is_oa":true,"landing_page_url":"https://doi.org/10.1006/jcss.1997.1493","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1006/jcss.1997.1493","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Monika R Henzinger","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, New York, 14853"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, New York, 14853","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Department of Computer Science, Brown Univrsity, Providence, Rhode Island, 02912"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown Univrsity, Providence, Rhode Island, 02912","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103783564","display_name":"Satish Rao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["NEC Research Institute"],"affiliations":[{"raw_affiliation_string":"NEC Research Institute","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054397956","display_name":"Sairam Subramanian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sairam Subramanian","raw_affiliation_strings":["Bell Northern Research"],"affiliations":[{"raw_affiliation_string":"Bell Northern Research","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003641345"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":{"value":2520,"currency":"USD","value_usd":2520},"fwci":9.2998,"has_fulltext":false,"cited_by_count":410,"citation_normalized_percentile":{"value":0.98439909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"55","issue":"1","first_page":"3","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6708946824073792},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6631655097007751},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.6081741452217102},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5958926677703857},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5714284181594849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5318343639373779},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5300694704055786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5001320838928223},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4667024612426758},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.44638606905937195},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4423120617866516},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.41917678713798523},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41651293635368347},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41065311431884766},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3710182309150696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3179730772972107},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3112655282020569},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.28262102603912354},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2692505121231079},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2675047516822815},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2476617693901062}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6708946824073792},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6631655097007751},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.6081741452217102},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5958926677703857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5714284181594849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5318343639373779},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5300694704055786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5001320838928223},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4667024612426758},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.44638606905937195},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4423120617866516},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.41917678713798523},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41651293635368347},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41065311431884766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3710182309150696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3179730772972107},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3112655282020569},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28262102603912354},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2692505121231079},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2675047516822815},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2476617693901062},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1006/jcss.1997.1493","is_oa":true,"landing_page_url":"https://doi.org/10.1006/jcss.1997.1493","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.1759","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.1759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/people/pnk/sepshort.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.4667","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/1997/Henzinger-1997-FSP.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:99342","is_oa":false,"landing_page_url":"http://infoscience.epfl.ch/record/99342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1006/jcss.1997.1493","is_oa":true,"landing_page_url":"https://doi.org/10.1006/jcss.1997.1493","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1485876617","https://openalex.org/W1540680813","https://openalex.org/W1759483102","https://openalex.org/W1968647828","https://openalex.org/W1987197912","https://openalex.org/W1992060486","https://openalex.org/W2010223239","https://openalex.org/W2032846330","https://openalex.org/W2038643780","https://openalex.org/W2058713098","https://openalex.org/W2067533448","https://openalex.org/W2070505654","https://openalex.org/W2073558110","https://openalex.org/W2084224084","https://openalex.org/W2104103056","https://openalex.org/W2105114849","https://openalex.org/W2111340560","https://openalex.org/W2113679823","https://openalex.org/W2120424341","https://openalex.org/W2121473031","https://openalex.org/W2129776415","https://openalex.org/W2138560648","https://openalex.org/W2145062394","https://openalex.org/W2152377721","https://openalex.org/W2160365857","https://openalex.org/W2164141517","https://openalex.org/W2164485560"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W2368259793","https://openalex.org/W2371403874","https://openalex.org/W651485002","https://openalex.org/W2147862592","https://openalex.org/W2371042914","https://openalex.org/W2597144308","https://openalex.org/W2100214387","https://openalex.org/W2810620529","https://openalex.org/W1987197912"],"abstract_inverted_index":{"We":[0,111],"give":[1,47,113],"a":[2,19,26,73,77,82,86,93,97],"linear-time":[3,20],"algorithm":[4,16,21,49,63],"for":[5,22,71,80,91],"single-source":[6],"shortest":[7],"paths":[8],"in":[9,25,76,85,96],"planar":[10,27,78,87,98],"graphs":[11],"with":[12,29],"nonnegative":[13],"edge-lengths.":[14],"Our":[15],"also":[17,112],"yields":[18],"maximum":[23,94],"flow":[24,75,95],"graph":[28,99],"the":[30,35,39,54,58,101,108],"source":[31,102],"and":[32,90,103,115],"sink":[33,104],"on":[34,107],"same":[36,109],"face.":[37,110],"For":[38],"case":[40],"where":[41],"negative":[42,60],"edge-lengths":[43],"are":[44,105],"allowed,":[45],"we":[46],"an":[48],"requiringO(n4/3":[50],"log(nL))":[51],"time,":[52],"whereLis":[53],"absolute":[55],"value":[56],"of":[57,118],"most":[59],"length.":[61],"This":[62],"can":[64],"be":[65],"used":[66],"to":[67],"obtain":[68],"similar":[69],"bounds":[70],"computing":[72],"feasible":[74],"network,":[79],"finding":[81,92],"perfect":[83],"matching":[84],"bipartite":[88],"graph,":[89],"when":[100],"not":[106],"parallel":[114],"dynamic":[116],"versions":[117],"these":[119],"algorithms.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":19}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}