{"id":"https://openalex.org/W4390188436","doi":"https://doi.org/10.1109/hpec58863.2023.10363452","title":"A GPU Parallel Algorithm for Finding a Negative Subset Disjoint Cycle in a Graph","display_name":"A GPU Parallel Algorithm for Finding a Negative Subset Disjoint Cycle in a Graph","publication_year":2023,"publication_date":"2023-09-25","ids":{"openalex":"https://openalex.org/W4390188436","doi":"https://doi.org/10.1109/hpec58863.2023.10363452"},"language":"en","primary_location":{"id":"doi:10.1109/hpec58863.2023.10363452","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-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/A5041755914","display_name":"Piotr Sielski","orcid":"https://orcid.org/0000-0002-4594-1854"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Piotr Sielski","raw_affiliation_strings":["NVIDIA"],"affiliations":[{"raw_affiliation_string":"NVIDIA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093577136","display_name":"Akif \u00c7\u00f6rd\u00fck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akif \u00c7\u00f6rd\u00fck","raw_affiliation_strings":["NVIDIA"],"affiliations":[{"raw_affiliation_string":"NVIDIA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001299382","display_name":"Hugo Linsenmaier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hugo Linsenmaier","raw_affiliation_strings":["NVIDIA"],"affiliations":[{"raw_affiliation_string":"NVIDIA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063168619","display_name":"Alex Fender","orcid":"https://orcid.org/0000-0002-0903-1407"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alex Fender","raw_affiliation_strings":["NVIDIA"],"affiliations":[{"raw_affiliation_string":"NVIDIA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041755914"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30382704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"91","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7509633302688599},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.730890154838562},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6702898740768433},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6012458205223083},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5196776986122131},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4779401123523712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43428346514701843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4331350326538086},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4249309003353119},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4145951569080353},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30932700634002686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20438796281814575},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08694678544998169},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07890301942825317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7509633302688599},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.730890154838562},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6702898740768433},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6012458205223083},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5196776986122131},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4779401123523712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43428346514701843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4331350326538086},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4249309003353119},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4145951569080353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30932700634002686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20438796281814575},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08694678544998169},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07890301942825317},{"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.1109/hpec58863.2023.10363452","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2033211895","https://openalex.org/W2048108791","https://openalex.org/W2053723217","https://openalex.org/W2075677840","https://openalex.org/W2090156293","https://openalex.org/W2151944609","https://openalex.org/W2165387188","https://openalex.org/W2172262914","https://openalex.org/W2616101379","https://openalex.org/W2618703364","https://openalex.org/W2752061190","https://openalex.org/W3181596661","https://openalex.org/W4239519089","https://openalex.org/W4308090300","https://openalex.org/W6635150654"],"related_works":["https://openalex.org/W2089134982","https://openalex.org/W2160145947","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4252842032","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3103742520"],"abstract_inverted_index":{"Many":[0],"problems":[1],"in":[2,72],"combinatorial":[3],"optimization":[4],"rely":[5],"on":[6],"local":[7],"search":[8,47],"heuristics":[9],"attempting":[10],"to":[11,57,122,135,140],"swap":[12],"elements":[13],"between":[14],"subsets.":[15],"The":[16,62,103,130],"best":[17,59],"results":[18],"are":[19],"achieved":[20],"by":[21],"combining":[22],"multiple":[23],"exchanges,":[24],"where":[25],"the":[26,42,46,50,58,76,108,124,128,141,146,158],"multi-subset":[27],"move":[28],"can":[29],"be":[30],"described":[31],"as":[32],"a":[33,38,69,86,99,153],"subset":[34,91],"disjoint":[35,92],"cycle.":[36],"Finding":[37],"valid":[39,51],"cycle":[40,52],"becomes":[41],"core":[43],"part":[44],"of":[45,53,78,95,127,149,157],"routine,":[48],"and":[49,81,98,113],"minimum":[54,96],"weight":[55,97],"corresponds":[56],"possible":[60],"move.":[61],"problem":[63],"complexity":[64],"has":[65],"been":[66],"growing":[67],"at":[68],"rapid":[70],"pace":[71],"recent":[73],"years,":[74],"hitting":[75],"limits":[77],"both":[79],"exact":[80,106],"heuristic":[82,114],"approaches.":[83],"We":[84,144],"propose":[85],"parallel":[87,117],"algorithm":[88,151],"for":[89,152],"finding":[90],"negative":[93],"cycles":[94],"GPU":[100],"accelerated":[101],"implementation.":[102],"approach":[104],"is":[105,111,120],"if":[107],"memory":[109],"limit":[110],"sufficient":[112],"otherwise.":[115],"A":[116],"hashmap":[118],"structure":[119],"provided":[121],"meet":[123],"specific":[125],"needs":[126],"algorithm.":[129],"computational":[131],"experiments":[132],"demonstrate":[133],"up":[134],"60x":[136],"speedup":[137],"with":[138],"respect":[139],"sequential":[142],"alternative.":[143],"showcase":[145],"practical":[147],"benefits":[148],"our":[150],"time":[154],"sensitive":[155],"variant":[156],"vehicle":[159],"routing":[160],"problem.":[161]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}