{"id":"https://openalex.org/W2952530739","doi":"https://doi.org/10.1145/3330345.3330368","title":"GPU road network graph contraction and SSSP query","display_name":"GPU road network graph contraction and SSSP query","publication_year":2019,"publication_date":"2019-06-18","ids":{"openalex":"https://openalex.org/W2952530739","doi":"https://doi.org/10.1145/3330345.3330368","mag":"2952530739"},"language":"en","primary_location":{"id":"doi:10.1145/3330345.3330368","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3330345.3330368","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3330345.3330368","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Supercomputing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3330345.3330368","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032995181","display_name":"Roozbeh Karimi","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roozbeh Karimi","raw_affiliation_strings":["Louisiana State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Louisiana State University","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036726653","display_name":"David M. Koppelman","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David M. Koppelman","raw_affiliation_strings":["Louisiana State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Louisiana State University","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026426371","display_name":"Chris J. Michael","orcid":null},"institutions":[{"id":"https://openalex.org/I1288214837","display_name":"United States Naval Research Laboratory","ror":"https://ror.org/04d23a975","country_code":"US","type":"facility","lineage":["https://openalex.org/I1288214837","https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris J. Michael","raw_affiliation_strings":["Naval Research Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Naval Research Laboratory","institution_ids":["https://openalex.org/I1288214837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955000281333923,"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.7595127820968628},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.7561177015304565},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5340594053268433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5153369307518005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4339006543159485},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42924246191978455}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7595127820968628},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.7561177015304565},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5340594053268433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5153369307518005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4339006543159485},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42924246191978455},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3330345.3330368","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3330345.3330368","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3330345.3330368","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Supercomputing","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.lsu.edu:eecs_pubs-1635","is_oa":true,"landing_page_url":"https://digitalcommons.lsu.edu/eecs_pubs/636","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},{"id":"pmh:oai:repository.lsu.edu:eecs_pubs-1635","is_oa":true,"landing_page_url":"https://repository.lsu.edu/eecs_pubs/636","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3330345.3330368","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3330345.3330368","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3330345.3330368","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Supercomputing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2963154741","display_name":null,"funder_award_id":"ACI-1265449","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3684207888","display_name":null,"funder_award_id":"N00173-16-2-C901","funder_id":"https://openalex.org/F4320337628","funder_display_name":"U.S. Naval Research Laboratory"},{"id":"https://openalex.org/G5852323595","display_name":"EAGER: Collaborative Research:  Using PDE Descriptions To Generate Code Precisely Tailored To Energy-Constrained Systems Including Large GPU Accelerated Clusters","funder_award_id":"1265449","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6113644922","display_name":null,"funder_award_id":"2015-16","funder_id":"https://openalex.org/F4320309392","funder_display_name":"Louisiana Board of Regents"},{"id":"https://openalex.org/G6401487099","display_name":null,"funder_award_id":"LEQSF(2015-16)-ENH-TR-10","funder_id":"https://openalex.org/F4320309392","funder_display_name":"Louisiana Board of Regents"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309392","display_name":"Louisiana Board of Regents","ror":"https://ror.org/00jv89z46"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337628","display_name":"U.S. Naval Research Laboratory","ror":"https://ror.org/04d23a975"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2952530739.pdf","grobid_xml":"https://content.openalex.org/works/W2952530739.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W85521454","https://openalex.org/W1904636577","https://openalex.org/W1965830721","https://openalex.org/W1980153429","https://openalex.org/W1982943597","https://openalex.org/W2019003829","https://openalex.org/W2041470524","https://openalex.org/W2057112598","https://openalex.org/W2071114738","https://openalex.org/W2071717275","https://openalex.org/W2095677000","https://openalex.org/W2104317982","https://openalex.org/W2107173440","https://openalex.org/W2124007994","https://openalex.org/W2148831787","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2264327568","https://openalex.org/W2323703259","https://openalex.org/W2461311369","https://openalex.org/W2502480331","https://openalex.org/W2523378841","https://openalex.org/W2572767837","https://openalex.org/W2951135776","https://openalex.org/W2963162524"],"related_works":["https://openalex.org/W4243145179","https://openalex.org/W4255875982","https://openalex.org/W4244853958","https://openalex.org/W2029404707","https://openalex.org/W4285325679","https://openalex.org/W4247719608","https://openalex.org/W4237439661","https://openalex.org/W1928239295","https://openalex.org/W4300465923","https://openalex.org/W2145423738"],"abstract_inverted_index":{"PHAST":[0,20],"is":[1,36,100],"to":[2,53,64,103],"date":[3],"one":[4,71],"of":[5,84,109],"the":[6,57,107],"fastest":[7],"algorithms":[8],"for":[9],"performing":[10],"single":[11],"source":[12],"shortest":[13],"path":[14,81],"(SSSP)":[15],"queries":[16],"on":[17,22,78,92],"road-network":[18],"graphs.":[19],"operates":[21],"graphs":[23,35,43],"produced":[24],"in":[25,47],"part":[26],"using":[27],"Geisberger's":[28],"contraction":[29,76],"hierarchy":[30],"(CH)":[31],"algorithm.":[32],"Producing":[33],"these":[34],"time":[37],"consuming,":[38],"limiting":[39],"PHAST's":[40],"usefulness":[41],"when":[42,69],"are":[44],"not":[45],"available":[46],"advance.":[48],"CH":[49,97],"iteratively":[50],"assigns":[51],"scores":[52],"nodes,":[54],"contracts":[55],"(removes)":[56],"highest-scoring":[58],"node,":[59],"and":[60,75,94,116],"adds":[61],"shortcut":[62],"edges":[63],"preserve":[65],"distances.":[66],"Iteration":[67],"stops":[68],"only":[70],"node":[72],"remains.":[73],"Scoring":[74],"rely":[77],"a":[79],"witness":[80],"search":[82],"(WPS)":[83],"nearby":[85],"nodes.":[86],"Little":[87],"work":[88],"has":[89],"been":[90],"reported":[91],"parallel":[93,117],"especially":[95],"GPU":[96],"algorithms.":[98],"This":[99],"perhaps":[101],"due":[102],"issues":[104],"such":[105],"as":[106],"validity":[108],"simultaneous":[110],"potentially":[111],"overlapping":[112],"searches,":[113],"score":[114],"staleness,":[115],"graph":[118],"updates.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}