{"id":"https://openalex.org/W7116916216","doi":"https://doi.org/10.1109/tpds.2025.3641049","title":"Faster Vertex Cover Algorithms on GPUs With Component-Aware Parallel Branching","display_name":"Faster Vertex Cover Algorithms on GPUs With Component-Aware Parallel Branching","publication_year":2025,"publication_date":"2025-12-23","ids":{"openalex":"https://openalex.org/W7116916216","doi":"https://doi.org/10.1109/tpds.2025.3641049"},"language":null,"primary_location":{"id":"doi:10.1109/tpds.2025.3641049","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2025.3641049","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.18334","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121102523","display_name":"Hussein Amro","orcid":null},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Hussein Amro","raw_affiliation_strings":["Department of Computer Science, American University of Beirut, Beirut, Lebanon"],"raw_orcid":"https://orcid.org/0009-0001-3438-372X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121071656","display_name":"Basel Fakhri","orcid":null},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Basel Fakhri","raw_affiliation_strings":["Department of Computer Science, American University of Beirut, Beirut, Lebanon"],"raw_orcid":"https://orcid.org/0009-0000-8630-9807","affiliations":[{"raw_affiliation_string":"Department of Computer Science, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051065386","display_name":"Amer E. Mouawad","orcid":"https://orcid.org/0000-0003-2481-4968"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Amer E. Mouawad","raw_affiliation_strings":["Department of Computer Science, American University of Beirut, Beirut, Lebanon"],"raw_orcid":"https://orcid.org/0000-0003-2481-4968","affiliations":[{"raw_affiliation_string":"Department of Computer Science, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110919585","display_name":"Izzat El Hajj","orcid":null},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Izzat El Hajj","raw_affiliation_strings":["Department of Computer Science, American University of Beirut, Beirut, Lebanon"],"raw_orcid":"https://orcid.org/0000-0003-3356-6898","affiliations":[{"raw_affiliation_string":"Department of Computer Science, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5121102523"],"corresponding_institution_ids":["https://openalex.org/I98635879"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60892035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"2","first_page":"504","last_page":"517"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6879000067710876,"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.6879000067710876,"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.07800000160932541,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.03970000147819519,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/memory-footprint","display_name":"Memory footprint","score":0.6251999735832214},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4932999908924103},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4672999978065491},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4422999918460846},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3813000023365021},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.3589000105857849},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.35839998722076416},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.33230000734329224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8514000177383423},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.6251999735832214},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6089000105857849},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4932999908924103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4672999978065491},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4422999918460846},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3813000023365021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37299999594688416},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3562999963760376},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3255000114440918},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.31690001487731934},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3019999861717224},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2025.3641049","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2025.3641049","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2512.18334","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.18334","pdf_url":"https://arxiv.org/pdf/2512.18334","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.18334","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.18334","pdf_url":"https://arxiv.org/pdf/2512.18334","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1436538595","https://openalex.org/W1504291959","https://openalex.org/W1517036688","https://openalex.org/W1518653692","https://openalex.org/W1557597301","https://openalex.org/W1599636498","https://openalex.org/W1971346768","https://openalex.org/W1972577597","https://openalex.org/W1973852671","https://openalex.org/W1983330102","https://openalex.org/W2020681752","https://openalex.org/W2059451253","https://openalex.org/W2072680607","https://openalex.org/W2073025989","https://openalex.org/W2077654620","https://openalex.org/W2089718638","https://openalex.org/W2097844290","https://openalex.org/W2116721352","https://openalex.org/W2155852554","https://openalex.org/W2157983116","https://openalex.org/W2166491841","https://openalex.org/W2185104320","https://openalex.org/W2286462955","https://openalex.org/W2287247185","https://openalex.org/W2513955757","https://openalex.org/W2611998574","https://openalex.org/W2782087530","https://openalex.org/W2790789009","https://openalex.org/W2840315815","https://openalex.org/W2891759099","https://openalex.org/W2903686141","https://openalex.org/W2951135776","https://openalex.org/W2963875241","https://openalex.org/W2984744606","https://openalex.org/W3006582303","https://openalex.org/W3010460567","https://openalex.org/W3021196172","https://openalex.org/W3136926519","https://openalex.org/W3142927759","https://openalex.org/W3164237119","https://openalex.org/W4220807878","https://openalex.org/W4231595696","https://openalex.org/W4282981834","https://openalex.org/W4285609506","https://openalex.org/W4292230561","https://openalex.org/W4312060056","https://openalex.org/W4385585485","https://openalex.org/W4386709687","https://openalex.org/W4390280309","https://openalex.org/W4413411836"],"related_works":[],"abstract_inverted_index":{"Algorithms":[0],"for":[1,90],"finding":[2],"minimum":[3],"or":[4],"bounded":[5],"vertex":[6,91],"covers":[7],"in":[8,169,196],"graphs":[9,52],"use":[10],"a":[11,17,34,86,97,153,197],"branch-and-reduce":[12],"strategy,":[13],"which":[14,121],"involves":[15],"exploring":[16,156],"highly":[18],"imbalanced":[19],"search":[20,158],"tree.":[21,159],"Prior":[22],"GPU":[23,88,166],"solutions":[24,44,114],"assign":[25],"different":[26,30,116],"thread":[27],"blocks":[28],"to":[29,37,48,65,111,134,189],"sub-trees,":[31],"while":[32],"using":[33],"shared":[35],"worklist":[36],"balance":[38],"the":[39,58,76,105,109,113,132,135,144,149,157,164,172,179,187],"load.":[40],"However,":[41],"these":[42,67],"prior":[43],"do":[45],"not":[46],"scale":[47],"large":[49],"and":[50,102,151],"complex":[51],"because":[53],"their":[54,71],"unawareness":[55],"of":[56,78,115,138,181],"when":[57,96,171],"graph":[59,98,150],"splits":[60,99],"into":[61,100],"components":[62,68,101,106,117],"causes":[63],"them":[64],"solve":[66],"redundantly.":[69],"Moreover,":[70],"high":[72],"memory":[73,145],"footprint":[74,146],"limits":[75],"number":[77],"workers":[79],"that":[80,94],"can":[81],"execute":[82],"concurrently.":[83],"We":[84,141],"propose":[85],"novel":[87],"solution":[89,161,174],"cover":[92],"problems":[93],"detects":[95],"branches":[103,120],"on":[104,194],"independently.":[107],"Although":[108],"need":[110],"aggregate":[112],"introduces":[118],"non-tail-recursive":[119,191],"interfere":[122],"with":[123],"load":[124,198],"balancing,":[125],"we":[126],"overcome":[127],"this":[128],"challenge":[129],"by":[130,147],"delegating":[131],"post-processing":[133],"last":[136],"descendant":[137],"each":[139],"branch.":[140],"also":[142],"reduce":[143],"reducing":[148],"inducing":[152],"subgraph":[154],"before":[155],"Our":[160],"substantially":[162],"outperforms":[163],"state-of-the-art":[165,173],"solution,":[167],"finishing":[168],"seconds":[170],"exceeds":[175],"6":[176],"hours.":[177],"To":[178],"best":[180],"our":[182,184],"knowledge,":[183],"work":[185],"is":[186],"first":[188],"parallelize":[190],"branching":[192],"patterns":[193],"GPUs":[195],"balanced":[199],"manner.":[200]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-23T00:00:00"}