{"id":"https://openalex.org/W2904705844","doi":"https://doi.org/10.1007/978-981-13-3441-2_2","title":"Scalable Single-Source Shortest Path Algorithms on Distributed Memory Systems","display_name":"Scalable Single-Source Shortest Path Algorithms on Distributed Memory Systems","publication_year":2018,"publication_date":"2018-12-10","ids":{"openalex":"https://openalex.org/W2904705844","doi":"https://doi.org/10.1007/978-981-13-3441-2_2","mag":"2904705844"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-13-3441-2_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-13-3441-2_2","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5072228838","display_name":"Thap Panitanarak","orcid":null},"institutions":[{"id":"https://openalex.org/I158708052","display_name":"Chulalongkorn University","ror":"https://ror.org/028wp3y58","country_code":"TH","type":"education","lineage":["https://openalex.org/I158708052"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Thap Panitanarak","raw_affiliation_strings":["Department of Mathematics and Computer Science, Chulalongkorn University, Patumwan, 10330, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Chulalongkorn University, Patumwan, 10330, Bangkok, Thailand","institution_ids":["https://openalex.org/I158708052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072228838"],"corresponding_institution_ids":["https://openalex.org/I158708052"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21113882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"33"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9965000152587891,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8186889886856079},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7876248359680176},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6724346280097961},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5738955140113831},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5594684481620789},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.5367231369018555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4783698618412018},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.45035916566848755},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4493013024330139},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4269344210624695},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39002153277397156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8186889886856079},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7876248359680176},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6724346280097961},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5738955140113831},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5594684481620789},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.5367231369018555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4783698618412018},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.45035916566848755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4493013024330139},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4269344210624695},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39002153277397156},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-13-3441-2_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-13-3441-2_2","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information 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":20,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1593868476","https://openalex.org/W1982003698","https://openalex.org/W2000041758","https://openalex.org/W2041470524","https://openalex.org/W2057112598","https://openalex.org/W2064635301","https://openalex.org/W2066133878","https://openalex.org/W2091924280","https://openalex.org/W2096544401","https://openalex.org/W2107173440","https://openalex.org/W2128653745","https://openalex.org/W2144085134","https://openalex.org/W2149071703","https://openalex.org/W2150898004","https://openalex.org/W2154111453","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2995564009","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W4235240664","https://openalex.org/W2965083567","https://openalex.org/W1838576100","https://openalex.org/W2095886385","https://openalex.org/W2889616422","https://openalex.org/W4387860419","https://openalex.org/W2267666206","https://openalex.org/W2498592833","https://openalex.org/W2396978051"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}