{"id":"https://openalex.org/W2052770190","doi":"https://doi.org/10.1007/bf01901194","title":"Parallel algorithms for shortest path problems in polygons","display_name":"Parallel algorithms for shortest path problems in polygons","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2052770190","doi":"https://doi.org/10.1007/bf01901194","mag":"2052770190"},"language":"en","primary_location":{"id":"doi:10.1007/bf01901194","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01901194","pdf_url":null,"source":{"id":"https://openalex.org/S73060445","display_name":"The Visual Computer","issn_l":"0178-2789","issn":["0178-2789","1432-2315"],"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":"The Visual Computer","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/A5008849727","display_name":"Hossam ElGindy","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hossam ElGindy","raw_affiliation_strings":["School of Computer Science, McGill University, H3A 2K6, Montreal, Quebec, Canada","School of Computer Science, McGill University Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, H3A 2K6, Montreal, Quebec, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"School of Computer Science, McGill University Montreal, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Goodrich","raw_affiliation_strings":["Department of Computer Science, The Johns Hopkins University, Baltimore, Maryland, USA","Department of Computer Science, The Johns Hopkins University, Baltimore, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, Baltimore, Maryland, USA","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, Baltimore, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.2829,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.83034648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"371","last_page":"378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6701751947402954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6557257771492004},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5653833150863647},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5572227835655212},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5273635983467102},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5031470656394958},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48112693428993225},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47995832562446594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47387099266052246},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4618169069290161},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45820239186286926},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42520615458488464},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.4117385745048523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28475314378738403},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2524871826171875},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2119360864162445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12092912197113037}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6701751947402954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6557257771492004},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5653833150863647},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5572227835655212},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5273635983467102},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5031470656394958},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48112693428993225},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47995832562446594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47387099266052246},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4618169069290161},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45820239186286926},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42520615458488464},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.4117385745048523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28475314378738403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2524871826171875},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2119360864162445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12092912197113037},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01901194","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01901194","pdf_url":null,"source":{"id":"https://openalex.org/S73060445","display_name":"The Visual Computer","issn_l":"0178-2789","issn":["0178-2789","1432-2315"],"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":"The Visual Computer","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W24696750","https://openalex.org/W1493041473","https://openalex.org/W1975510415","https://openalex.org/W1977119258","https://openalex.org/W1979036815","https://openalex.org/W1981233261","https://openalex.org/W1995040285","https://openalex.org/W2003583528","https://openalex.org/W2005314985","https://openalex.org/W2009530930","https://openalex.org/W2011573873","https://openalex.org/W2014320134","https://openalex.org/W2022754388","https://openalex.org/W2032159439","https://openalex.org/W2038599141","https://openalex.org/W2042607215","https://openalex.org/W2069750902","https://openalex.org/W2120104755","https://openalex.org/W2163178194","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565","https://openalex.org/W2896729805"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}