{"id":"https://openalex.org/W4384662187","doi":"https://doi.org/10.1145/3597635.3598019","title":"Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract)","display_name":"Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract)","publication_year":2023,"publication_date":"2023-07-18","ids":{"openalex":"https://openalex.org/W4384662187","doi":"https://doi.org/10.1145/3597635.3598019"},"language":"en","primary_location":{"id":"doi:10.1145/3597635.3598019","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598019","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598019","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598019","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]},{"id":"https://openalex.org/I2803044603","display_name":"Brighton Hospital","ror":"https://ror.org/006yjsn14","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1320343167","https://openalex.org/I2803044603"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Boston College, Brighton, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-4961-763X","affiliations":[{"raw_affiliation_string":"Boston College, Brighton, MA, USA","institution_ids":["https://openalex.org/I2803044603","https://openalex.org/I103531236"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0009-0000-7483-4532","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022670058","display_name":"Katina Russell","orcid":"https://orcid.org/0009-0005-6230-8427"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katina Russell","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0009-0005-6230-8427","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030710270"],"corresponding_institution_ids":["https://openalex.org/I103531236","https://openalex.org/I2803044603"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53544875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"4"},"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.9991999864578247,"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.9991999864578247,"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.9962000250816345,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9908000230789185,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7237358093261719},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7071642279624939},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.621247410774231},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5691750645637512},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.5195391774177551},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5187956690788269},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4390423595905304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42745646834373474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40333181619644165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37494558095932007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35711878538131714}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7237358093261719},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7071642279624939},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.621247410774231},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5691750645637512},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.5195391774177551},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5187956690788269},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4390423595905304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42745646834373474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40333181619644165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37494558095932007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35711878538131714}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3597635.3598019","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598019","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598019","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3597635.3598019","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597635.3598019","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597635.3598019","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1276241304","display_name":null,"funder_award_id":"CCF-2106759","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7681175234","display_name":null,"funder_award_id":"CCF-1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051948103","display_name":"SPX: Automatically Parallelizing Approximate Data Analysis with Mergeable Summaries","funder_award_id":"1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4384662187.pdf","grobid_xml":"https://content.openalex.org/works/W4384662187.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1986816824","https://openalex.org/W2056496054","https://openalex.org/W2063301486","https://openalex.org/W2075862701","https://openalex.org/W2084224084","https://openalex.org/W2269957429","https://openalex.org/W3046699603"],"related_works":["https://openalex.org/W4205772203","https://openalex.org/W2043128958","https://openalex.org/W3190612612","https://openalex.org/W2361081252","https://openalex.org/W2386416004","https://openalex.org/W2075073335","https://openalex.org/W3196191381","https://openalex.org/W2346528079","https://openalex.org/W2764127424","https://openalex.org/W4387860419"],"abstract_inverted_index":{"The":[0],"single-source":[1,35],"shortest-path":[2],"problem":[3,53],"is":[4],"as":[5],"follows:":[6],"given":[7],"a":[8,15,32],"graph":[9],"with":[10,43,61,69],"nonnegative":[11],"edge":[12,46],"weights":[13,47],"and":[14,58],"designated":[16],"source":[17],"vertex":[18,27],"s,":[19],"return":[20],"the":[21,50],"distances":[22],"from~s":[23],"to":[24],"each":[25],"other":[26],"such.":[28],"This":[29],"paper":[30],"presents":[31],"randomized":[33],"parallel":[34],"shortest":[36],"paths":[37],"(SSSP)":[38],"algorithm":[39],"for":[40,77],"directed":[41],"graphs":[42],"non-negative":[44],"integer":[45],"that":[48],"solves":[49],"exact":[51,66],"SSSP":[52,67],"in":[54],"O":[55],"(m)":[56],"work":[57,72],"n^1/2+o(1)":[59],"span,":[60,75],"high":[62],"probability.":[63],"All":[64],"previous":[65],"algorithms":[68],"nearly":[70],"linear":[71,74],"have":[73],"even":[76],"undirected":[78],"unweighted":[79],"graphs.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}