{"id":"https://openalex.org/W4415250906","doi":"https://doi.org/10.1109/hpec67600.2025.11196090","title":"HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs","display_name":"HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250906","doi":"https://doi.org/10.1109/hpec67600.2025.11196090"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5012058924","display_name":"Mohammad Dindoost","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad Dindoost","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070173078","display_name":"Oliver Alvarado Rodriguez","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oliver Alvarado Rodriguez","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120024887","display_name":"Bartosz Bryg","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bartosz Bryg","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066131957","display_name":"Ioannis Koutis","orcid":"https://orcid.org/0000-0003-1535-3397"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioannis Koutis","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Bader","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5012058924"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":2.7467,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.92003418,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926000237464905,"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/pruning","display_name":"Pruning","score":0.7562000155448914},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6711000204086304},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5860000252723694},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5823000073432922},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5446000099182129},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5056999921798706},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49300000071525574},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4564000070095062},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.43230000138282776}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7562000155448914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837999820709229},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6711000204086304},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5860000252723694},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5823000073432922},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5446000099182129},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5056999921798706},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49300000071525574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47850000858306885},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4564000070095062},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38420000672340393},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.27070000767707825},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.260699987411499},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2578999996185303},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.25049999356269836},{"id":"https://openalex.org/C194051981","wikidata":"https://www.wikidata.org/wiki/Q1337691","display_name":"Economic shortage","level":3,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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":43,"referenced_works":["https://openalex.org/W112051401","https://openalex.org/W993733874","https://openalex.org/W1217907795","https://openalex.org/W1975068437","https://openalex.org/W1979566015","https://openalex.org/W2024729467","https://openalex.org/W2032280284","https://openalex.org/W2061425021","https://openalex.org/W2062533676","https://openalex.org/W2079668713","https://openalex.org/W2089554624","https://openalex.org/W2090409324","https://openalex.org/W2108614537","https://openalex.org/W2109110326","https://openalex.org/W2126359798","https://openalex.org/W2143163611","https://openalex.org/W2147405597","https://openalex.org/W2150871235","https://openalex.org/W2153624566","https://openalex.org/W2169462328","https://openalex.org/W2423652555","https://openalex.org/W2608355501","https://openalex.org/W2782973036","https://openalex.org/W2886575626","https://openalex.org/W2948167003","https://openalex.org/W2948359422","https://openalex.org/W2948407395","https://openalex.org/W2949808130","https://openalex.org/W2970282997","https://openalex.org/W3016007634","https://openalex.org/W3025380722","https://openalex.org/W3173361933","https://openalex.org/W3174415204","https://openalex.org/W3184260604","https://openalex.org/W4312158856","https://openalex.org/W4312246606","https://openalex.org/W4390189094","https://openalex.org/W4393183677","https://openalex.org/W4396780205","https://openalex.org/W4403062911","https://openalex.org/W4403062913","https://openalex.org/W4409131829","https://openalex.org/W4415250906"],"related_works":[],"abstract_inverted_index":{"Subgraph":[0],"isomorphism":[1],"algorithms":[2],"face":[3],"significant":[4],"scalability":[5],"bottlenecks":[6],"on":[7,99],"large-scale":[8,134],"property":[9],"graphs":[10,47],"due":[11,120],"to":[12,48,96,118,121],"inefficient":[13],"vertex-by-vertex":[14],"search":[15,22,69],"that":[16,36,114],"requires":[17],"extensive":[18],"exploration":[19,77],"of":[20,105],"early":[21,76],"tree":[23],"levels":[24],"where":[25],"pruning":[26],"is":[27],"minimal.":[28],"We":[29],"present":[30],"HiPerMotif,":[31],"a":[32],"hybrid":[33],"parallel":[34],"algorithm":[35],"overcomes":[37],"these":[38,63],"limitations":[39],"through":[40],"edge-centric":[41],"initialization.":[42],"HiPerMotif":[43,130],"first":[44],"reorders":[45],"pattern":[46],"prioritize":[49],"high-connectivity":[50],"vertices,":[51],"then":[52],"systematically":[53],"identifies":[54],"and":[55,102,140],"validates":[56],"all":[57],"possible":[58],"first-edge":[59],"mappings":[60],"before":[61],"injecting":[62],"pre-validated":[64],"partial":[65],"states":[66],"directly":[67],"at":[68],"depth":[70],"2.":[71],"This":[72],"approach":[73],"eliminates":[74],"costly":[75],"while":[78],"enabling":[79],"natural":[80],"parallelization":[81],"over":[82],"independent":[83],"edge":[84],"candidates.":[85],"Comprehensive":[86],"evaluation":[87],"against":[88],"state-of-the-art":[89],"baselines":[90],"(VF2-PS,":[91],"VF3P,":[92],"Glasgow)":[93],"demonstrates":[94],"up":[95],"66\u00d7":[97],"speedup":[98],"real-world":[100],"networks":[101],"successful":[103],"processing":[104],"massive":[106],"datasets":[107],"like":[108],"the":[109,126],"150M-edge":[110],"H01":[111],"human":[112],"connectome":[113],"cause":[115],"existing":[116],"methods":[117],"fail":[119],"memory":[122],"constraints.":[123],"Implemented":[124],"in":[125,137],"open-source":[127],"Arkouda/Arachne":[128],"framework,":[129],"enables":[131],"previously":[132],"intractable":[133],"network":[135],"analysis":[136],"computational":[138],"neuroscience":[139],"related":[141],"domains.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-16T00:00:00"}