{"id":"https://openalex.org/W1972455324","doi":"https://doi.org/10.1007/bf01294130","title":"An efficient parallel algorithm for shortest paths in planar layered digraphs","display_name":"An efficient parallel algorithm for shortest paths in planar layered digraphs","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W1972455324","doi":"https://doi.org/10.1007/bf01294130","mag":"1972455324"},"language":"en","primary_location":{"id":"doi:10.1007/bf01294130","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01294130","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5054397956","display_name":"Sairam Subramanian","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":"S. Subramanian","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912-1910, Providence, RI, USA","Dept of Computer Science, Brown University, Providence, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912-1910, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109934068","display_name":"R. Tamassia","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":"R. Tamassia","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912-1910, Providence, RI, USA","Dept of Computer Science, Brown University, Providence, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912-1910, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. S. Vitter","raw_affiliation_strings":["Department of Computer Science, Duke University, 27708-0129, Durham, NC, USA","Department of Computer Science Duke University, Durham, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, 27708-0129, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Computer Science Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5341,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.61807021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"322","last_page":"339"},"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.9997000098228455,"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.9997000098228455,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6841003894805908},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6661157608032227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.596206545829773},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5892481207847595},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5528964400291443},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5484458208084106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5338109135627747},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49249109625816345},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.43219444155693054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4260403513908386},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41764187812805176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37927311658859253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37812894582748413},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36534059047698975}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6841003894805908},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6661157608032227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.596206545829773},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5892481207847595},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5528964400291443},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5484458208084106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5338109135627747},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49249109625816345},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.43219444155693054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4260403513908386},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41764187812805176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37927311658859253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37812894582748413},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36534059047698975},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf01294130","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01294130","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.1543","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.duke.edu/pub/dist/techreport/1993/1993-30.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.3677","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.3677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~jsv/Papers/STV92.layered_shortest.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W1512436171","https://openalex.org/W1512709563","https://openalex.org/W1525833494","https://openalex.org/W1547233734","https://openalex.org/W1982180670","https://openalex.org/W1985495277","https://openalex.org/W1997039683","https://openalex.org/W2041372264","https://openalex.org/W2049413646","https://openalex.org/W2053740287","https://openalex.org/W2056711744","https://openalex.org/W2061420453","https://openalex.org/W2063204215","https://openalex.org/W2067533448","https://openalex.org/W2084224084","https://openalex.org/W2096827683","https://openalex.org/W2105114849","https://openalex.org/W2120424341","https://openalex.org/W2125690626","https://openalex.org/W2132750992","https://openalex.org/W2135674162","https://openalex.org/W2165968314","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2618199688"],"related_works":["https://openalex.org/W4286247391","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1838063489","https://openalex.org/W1577155814","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2038796709","https://openalex.org/W2025220494","https://openalex.org/W1545170796"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}