{"id":"https://openalex.org/W1566326249","doi":"https://doi.org/10.1007/3-540-48224-5_15","title":"All-Pairs Shortest Paths Computation in the BSP Model","display_name":"All-Pairs Shortest Paths Computation in the BSP Model","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1566326249","doi":"https://doi.org/10.1007/3-540-48224-5_15","mag":"1566326249"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_15","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":null,"display_name":"Alexandre Tiskin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexandre Tiskin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3882,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.55133546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"178","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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/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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/computer-science","display_name":"Computer science","score":0.8176982998847961},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7320878505706787},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6944475769996643},{"id":"https://openalex.org/keywords/bulk-synchronous-parallel","display_name":"Bulk synchronous parallel","score":0.5946937799453735},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.5515760779380798},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5386180281639099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4774085581302643},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4558592438697815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4483974874019623},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4428127408027649},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4318544268608093},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4103168845176697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4092858135700226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1297612488269806}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8176982998847961},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7320878505706787},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6944475769996643},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.5946937799453735},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.5515760779380798},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5386180281639099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4774085581302643},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4558592438697815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4483974874019623},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4428127408027649},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4318544268608093},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4103168845176697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4092858135700226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1297612488269806},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":1,"locations":[{"id":"doi:10.1007/3-540-48224-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_15","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":23,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W139983096","https://openalex.org/W1488103720","https://openalex.org/W1557235141","https://openalex.org/W1580684925","https://openalex.org/W1979740015","https://openalex.org/W1979867994","https://openalex.org/W1986830645","https://openalex.org/W2022980325","https://openalex.org/W2045271686","https://openalex.org/W2065231486","https://openalex.org/W2155721019","https://openalex.org/W2169528473","https://openalex.org/W2171697943","https://openalex.org/W2429693405","https://openalex.org/W2618199688","https://openalex.org/W2752885492","https://openalex.org/W2914953275","https://openalex.org/W2974116768","https://openalex.org/W4248725703","https://openalex.org/W4256581173","https://openalex.org/W6605640564","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2498592833"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}