{"id":"https://openalex.org/W91235948","doi":"https://doi.org/10.1007/3-540-12689-9_113","title":"A single source shortest path algorithm for graphs with separators","display_name":"A single source shortest path algorithm for graphs with separators","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W91235948","doi":"https://doi.org/10.1007/3-540-12689-9_113","mag":"91235948"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-12689-9_113","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-12689-9_113","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"K. Mehlhorn","raw_affiliation_strings":["Fachbereich 10 \u2014 Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, 6600, Saarbr\u00fccken, West Germany","UniVersit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich 10 \u2014 Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, 6600, Saarbr\u00fccken, West Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"UniVersit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048234355","display_name":"Bernd H. Schmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"B. H. Schmidt","raw_affiliation_strings":["Fachbereich 10 \u2014 Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, 6600, Saarbr\u00fccken, West Germany","UniVersit\u00e4t des Saarlandes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich 10 \u2014 Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, 6600, Saarbr\u00fccken, West Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"UniVersit\u00e4t des Saarlandes","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"309"},"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.9976000189781189,"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.9976000189781189,"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/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separator","display_name":"Separator (oil production)","score":0.7235626578330994},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.68361896276474},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6352290511131287},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6262096762657166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6034782528877258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5089507102966309},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.471011757850647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4436846971511841},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42331066727638245},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3382786214351654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33611059188842773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2429513931274414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22660773992538452},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1455392837524414},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10115191340446472},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08954286575317383},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.061115145683288574}],"concepts":[{"id":"https://openalex.org/C185004128","wikidata":"https://www.wikidata.org/wiki/Q3011536","display_name":"Separator (oil production)","level":2,"score":0.7235626578330994},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.68361896276474},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6352290511131287},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6262096762657166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6034782528877258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5089507102966309},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.471011757850647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4436846971511841},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42331066727638245},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3382786214351654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33611059188842773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2429513931274414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22660773992538452},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1455392837524414},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10115191340446472},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08954286575317383},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.061115145683288574},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-12689-9_113","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-12689-9_113","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2007572995","https://openalex.org/W2038643780","https://openalex.org/W2149342630","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W6601728106"],"related_works":["https://openalex.org/W4249175327","https://openalex.org/W2063487995","https://openalex.org/W2971636757","https://openalex.org/W2511745526","https://openalex.org/W4301098834","https://openalex.org/W1978784234","https://openalex.org/W2383601987","https://openalex.org/W1990106678","https://openalex.org/W3216105633","https://openalex.org/W2990956612"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}