{"id":"https://openalex.org/W1971715758","doi":"https://doi.org/10.1007/bf01994878","title":"Efficient parallel algorithms for shortest paths in planar digraphs","display_name":"Efficient parallel algorithms for shortest paths in planar digraphs","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W1971715758","doi":"https://doi.org/10.1007/bf01994878","mag":"1971715758"},"language":"en","primary_location":{"id":"doi:10.1007/bf01994878","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01994878","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"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":"BIT","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/A5001248687","display_name":"Grammati Pantziou","orcid":"https://orcid.org/0000-0002-7890-825X"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Grammati E. Pantziou","raw_affiliation_strings":["Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","Computer Technology Institute, Patras, GREECE#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute, Patras, GREECE#TAB#","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["GR","US"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":["Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","Courant Institute of Math. Sciences, New York University, 251 Mercer Street, 10012, New York, NY, USA","Courant Institute of Math. Sciences, New York University, New York, USA","Computer Technology Institute, Patras, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Courant Institute of Math. Sciences, New York University, 251 Mercer Street, 10012, New York, NY, USA","institution_ids":["https://openalex.org/I36672615"]},{"raw_affiliation_string":"Courant Institute of Math. Sciences, New York University, New York, USA","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Computer Technology Institute, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos D. Zaroliagis","raw_affiliation_strings":["Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","Computer Technology Institute, Patras, GREECE#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":"Computer Technology Institute, Patras, GREECE#TAB#","institution_ids":["https://openalex.org/I120729142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.882,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90173549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":"2","first_page":"215","last_page":"236"},"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.9998000264167786,"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.9998000264167786,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"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.6361548900604248},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5659986138343811},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5656778812408447},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.526735782623291},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5087984204292297},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46609723567962646},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4628872573375702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4609980583190918},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43292784690856934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.425503134727478},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39058366417884827},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33895012736320496}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6361548900604248},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5659986138343811},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5656778812408447},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.526735782623291},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5087984204292297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46609723567962646},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4628872573375702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4609980583190918},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43292784690856934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.425503134727478},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39058366417884827},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33895012736320496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01994878","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01994878","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"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":"BIT","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.423.3795","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.3795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ceid.upatras.gr/faculty/zaro/pub/jou/J3-BIT.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1511174345","https://openalex.org/W1512709563","https://openalex.org/W1545671234","https://openalex.org/W1594925095","https://openalex.org/W1608198357","https://openalex.org/W1876661458","https://openalex.org/W1965874601","https://openalex.org/W1971715758","https://openalex.org/W2007572995","https://openalex.org/W2028341270","https://openalex.org/W2029342163","https://openalex.org/W2033177550","https://openalex.org/W2040444410","https://openalex.org/W2049021301","https://openalex.org/W2060435478","https://openalex.org/W2063048655","https://openalex.org/W2065759448","https://openalex.org/W2081385108","https://openalex.org/W2084224084","https://openalex.org/W2105114849","https://openalex.org/W2144970024","https://openalex.org/W2148686552","https://openalex.org/W2169528473","https://openalex.org/W3145802425","https://openalex.org/W4247322843"],"related_works":["https://openalex.org/W2082479932","https://openalex.org/W1798304401","https://openalex.org/W2476624396","https://openalex.org/W4302177579","https://openalex.org/W2023670982","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1838063489","https://openalex.org/W1577155814","https://openalex.org/W2099271296"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}