{"id":"https://openalex.org/W4316252359","doi":"https://doi.org/10.1145/3545008.3545035","title":"Highly Parallel Linear Forest Extraction from a Weighted Graph on GPUs","display_name":"Highly Parallel Linear Forest Extraction from a Weighted Graph on GPUs","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4316252359","doi":"https://doi.org/10.1145/3545008.3545035"},"language":"en","primary_location":{"id":"doi:10.1145/3545008.3545035","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3545008.3545035","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3545008.3545035","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","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/3545008.3545035","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007464024","display_name":"Christoph Klein","orcid":"https://orcid.org/0000-0003-2019-6074"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Klein","raw_affiliation_strings":["Heidelberg University, Germany"],"affiliations":[{"raw_affiliation_string":"Heidelberg University, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047006398","display_name":"Robert Strzodka","orcid":"https://orcid.org/0000-0003-0468-0472"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Robert Strzodka","raw_affiliation_strings":["Heidelberg University, Germany"],"affiliations":[{"raw_affiliation_string":"Heidelberg University, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007464024"],"corresponding_institution_ids":["https://openalex.org/I223822909"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14426285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"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/graph-factorization","display_name":"Graph factorization","score":0.6488627791404724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5964381694793701},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5135217308998108},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5055286884307861},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47903552651405334},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.47366222739219666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42426151037216187},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4182496964931488},{"id":"https://openalex.org/keywords/tridiagonal-matrix","display_name":"Tridiagonal matrix","score":0.4138807952404022},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34636104106903076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30913597345352173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19761767983436584},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13503724336624146},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07640770077705383}],"concepts":[{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.6488627791404724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5964381694793701},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5135217308998108},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5055286884307861},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47903552651405334},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.47366222739219666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42426151037216187},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4182496964931488},{"id":"https://openalex.org/C51647924","wikidata":"https://www.wikidata.org/wiki/Q1755277","display_name":"Tridiagonal matrix","level":3,"score":0.4138807952404022},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34636104106903076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30913597345352173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19761767983436584},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13503724336624146},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07640770077705383},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3545008.3545035","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3545008.3545035","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3545008.3545035","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3545008.3545035","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3545008.3545035","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3545008.3545035","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4316252359.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W43236068","https://openalex.org/W1506342804","https://openalex.org/W1845641575","https://openalex.org/W1879973584","https://openalex.org/W1964876237","https://openalex.org/W1972859808","https://openalex.org/W1976437885","https://openalex.org/W1984958506","https://openalex.org/W2007000019","https://openalex.org/W2008807330","https://openalex.org/W2013379422","https://openalex.org/W2017431061","https://openalex.org/W2035080386","https://openalex.org/W2037568485","https://openalex.org/W2068431006","https://openalex.org/W2069849438","https://openalex.org/W2104332310","https://openalex.org/W2131605101","https://openalex.org/W2145067004","https://openalex.org/W2155314350","https://openalex.org/W2225892715","https://openalex.org/W2273593125","https://openalex.org/W2278832816","https://openalex.org/W2301548481","https://openalex.org/W2401971606","https://openalex.org/W2626696598","https://openalex.org/W2762661956","https://openalex.org/W3152529346","https://openalex.org/W3204062674"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W1512756268","https://openalex.org/W2532922352","https://openalex.org/W2886672068","https://openalex.org/W167435155","https://openalex.org/W2035609387","https://openalex.org/W2953496651","https://openalex.org/W1887488684","https://openalex.org/W2604114816","https://openalex.org/W1739013558"],"abstract_inverted_index":{"For":[0],"graph":[1],"matching,":[2],"each":[3],"vertex":[4,106],"is":[5,31,56],"allowed":[6],"to":[7,43,104],"match":[8],"with":[9,48,102,167],"exactly":[10],"one":[11],"other":[12],"vertex,":[13],"such":[14],"that":[15],"the":[16,20,29,61,71,82,100,105,109,116,141,153,161],"spanning":[17,46],"subgraph":[18,30,47,55,101],"of":[19,26,52,63,75,91,119,136,144,163,169],"matching":[21],"has":[22],"a":[23,32,39,45,49,57,86,129],"maximum":[24,50,87],"degree":[25,51],"one,":[27],"i.e.,":[28],"[0,1]-factor.":[33],"In":[34],"this":[35],"work,":[36],"we":[37,84,139],"provide":[38],"highly":[40],"parallel":[41,122],"algorithm":[42,72],"extract":[44],"n":[53],"(the":[54],"[0,n]-factor)":[58],"and":[59,98,157,171],"demonstrate":[60,140],"efficiency":[62],"our":[64,120],"GPU":[65,117],"implementation":[66],"for":[67,148,165],"n=1,2,3,4":[68],"by":[69,94],"expressing":[70],"in":[73,160],"terms":[74],"generalized":[76],"sparse":[77],"matrix-vector":[78],"products.":[79],"Moreover,":[80],"from":[81,152],"[0,2]-factor,":[83],"compute":[85],"linear":[88,137],"forest":[89],"(union":[90],"disjoint":[92],"paths)":[93],"breaking":[95],"up":[96],"cycles":[97],"permuting":[99],"respect":[103],"order":[107,162],"within":[108],"paths.":[110],"Both":[111],"tasks":[112],"execute":[113],"efficiently":[114],"on":[115,173],"because":[118],"novel":[121],"scan":[123],"implementation,":[124],"which":[125],"does":[126],"not":[127],"require":[128],"random":[130],"access":[131],"iterator.":[132],"As":[133],"an":[134,174],"application":[135],"forests,":[138],"algebraic":[142],"creation":[143],"enhanced":[145],"tridiagonal":[146],"preconditioners":[147],"various":[149],"large":[150],"matrices":[151],"Sparse":[154],"Matrix":[155],"Collection":[156],"report":[158],"runtimes":[159],"milliseconds":[164],"graphs":[166],"millions":[168],"edges":[170],"vertices":[172],"RTX":[175],"2080":[176],"Ti.":[177]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2025-10-10T00:00:00"}