{"id":"https://openalex.org/W4417403580","doi":"https://doi.org/10.1109/pact65351.2025.00024","title":"Accelerating DFS-based Subgraph Matching on GPU via Reusing Intersection","display_name":"Accelerating DFS-based Subgraph Matching on GPU via Reusing Intersection","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4417403580","doi":"https://doi.org/10.1109/pact65351.2025.00024"},"language":null,"primary_location":{"id":"doi:10.1109/pact65351.2025.00024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","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/A5103639843","display_name":"Chen Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chen Chen","raw_affiliation_strings":["National University of Defense Technology,Changsha,Hunan,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,Changsha,Hunan,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035309411","display_name":"Shanzhi Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shanzhi Gu","raw_affiliation_strings":["National University of Defense Technology,Changsha,Hunan,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,Changsha,Hunan,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061525547","display_name":"Junsheng Chang","orcid":"https://orcid.org/0009-0006-3061-980X"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junsheng Chang","raw_affiliation_strings":["National University of Defense Technology,Changsha,Hunan,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,Changsha,Hunan,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101695058","display_name":"Li Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Shen","raw_affiliation_strings":["National University of Defense Technology,Changsha,Hunan,China"],"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,Changsha,Hunan,China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103639843"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40876083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9835000038146973,"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.9835000038146973,"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.002199999988079071,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002199999988079071,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.7788000106811523},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.678600013256073},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.555400013923645},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5383999943733215},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5117999911308289},{"id":"https://openalex.org/keywords/code-reuse","display_name":"Code reuse","score":0.40470001101493835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4016999900341034},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3758000135421753},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.36579999327659607}],"concepts":[{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.7788000106811523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7670000195503235},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.678600013256073},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.555400013923645},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5383999943733215},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5149000287055969},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C2778583558","wikidata":"https://www.wikidata.org/wiki/Q771245","display_name":"Code reuse","level":3,"score":0.40470001101493835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4016999900341034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39100000262260437},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.32659998536109924},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.31150001287460327},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3003000020980835},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28850001096725464},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2815000116825104},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pact65351.2025.00024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W993733874","https://openalex.org/W1532092812","https://openalex.org/W1553420678","https://openalex.org/W1979228272","https://openalex.org/W2132285256","https://openalex.org/W2163184742","https://openalex.org/W2948167003","https://openalex.org/W2950266617","https://openalex.org/W2951250282","https://openalex.org/W3097653461","https://openalex.org/W3186412358","https://openalex.org/W3206583875","https://openalex.org/W4285609551","https://openalex.org/W4321636650","https://openalex.org/W4401408744"],"related_works":[],"abstract_inverted_index":{"Subgraph":[0,36,257],"matching":[1,37,227],"is":[2,51,202],"a":[3,26,33,62,121,142,154,164,187,207],"well-known":[4],"NP-hard":[5],"problem":[6],"widely":[7],"applied":[8],"in":[9,25,55,73,101,147],"fields":[10],"such":[11],"as":[12],"bioinformatics,":[13],"cheminformatics,":[14],"and":[15,45,60,76,110,126,162,185,238,251],"social":[16],"network":[17],"analysis.":[18],"It":[19],"aims":[20],"to":[21,32,140,158,168,181,191,215,234],"enumerate":[22],"all":[23],"embeddings":[24],"data":[27],"graph":[28],"that":[29,193,211],"are":[30,68,137],"isomorphic":[31],"query":[34,131],"graph.":[35],"algorithms":[38,59,149],"can":[39,79],"be":[40,80],"roughly":[41],"classified":[42],"into":[43,105],"BFS-based":[44],"DFS-based":[46,89,103,148,226,256],"algorithms.":[47],"The":[48],"intersection":[49,71,220],"operation":[50,54],"the":[52,88,99,102,138,170,173,177,194,197,224,239],"core":[53],"both":[56],"types":[57],"of":[58,65,124,172,196],"consumes":[61],"significant":[63],"amount":[64],"time.":[66],"There":[67],"numerous":[69],"repeated":[70],"operations":[72],"subgraph":[74],"matching,":[75],"their":[77],"results":[78],"reused.":[81],"Recent":[82],"studies":[83],"have":[84],"focused":[85],"on":[86,91,150,200,259],"implementing":[87],"algorithm":[90,104],"GPUs":[92],"with":[93,223],"an":[94],"explicit":[95],"stack.":[96],"We":[97,152,175],"categorize":[98],"reuse":[100,109,146,159,201,240],"two":[106],"types:":[107],"within-stack":[108,117],"across-stack":[111,145],"reuse.":[112,174],"Previous":[113],"works":[114],"only":[115],"considered":[116],"reuse,":[118],"which":[119],"has":[120],"narrow":[122],"scope":[123],"application":[125],"lacks":[127],"generality":[128],"for":[129,144],"some":[130],"graphs.":[132],"In":[133],"this":[134],"paper,":[135],"we":[136,205],"first":[139],"propose":[141,206],"method":[143,210],"GPUs.":[151],"introduce":[153],"tree-structured":[155],"copy":[156],"stack":[157],"duplicate":[160],"intersections":[161],"design":[163],"secondary":[165],"checking":[166],"mechanism":[167,180],"ensure":[169],"correctness":[171],"use":[176],"non-blocking":[178,198],"lock":[179,199],"avoid":[182],"read-write":[183],"races":[184],"conduct":[186],"rigorous":[188],"theoretical":[189],"analysis":[190],"prove":[192],"impact":[195],"negligible.":[203],"Moreover,":[204],"GPU-specific":[208],"optimization":[209],"uses":[212],"key":[213],"nodes":[214],"reduce":[216],"memory":[217],"transactions":[218],"during":[219],"operations.":[221],"Compared":[222],"state-of-the-art":[225],"algorithms,":[228],"our":[229],"work":[230],"achieves":[231],"$1.12":[232],"\\times$":[233,236],"$1.95":[235],"speedup,":[237],"rate":[241],"reaches":[242],"78.68%.ACM":[243],"Reference":[244],"Format:Chen":[245],"Chen,":[246],"Shanzhi":[247],"Gu,":[248],"Junsheng":[249],"Chang,":[250],"Li":[252],"Shen.":[253],"2025.":[254],"Accelerating":[255],"Matching":[258],"GPU":[260],"via":[261],"Reusing":[262],"Intersection.":[263],"In.":[264],"ACM,":[265],"New":[266],"York,":[267],"NY,":[268],"USA,":[269],"12":[270],"pages.":[271],"https://doi.org/10.1145/nnnnnnn.nnnnnnnn":[272]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-16T00:00:00"}