{"id":"https://openalex.org/W2954463587","doi":"https://doi.org/10.1145/3323165.3323170","title":"A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)","display_name":"A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2954463587","doi":"https://doi.org/10.1145/3323165.3323170","mag":"2954463587"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323170","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","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/A5047980263","display_name":"Rohan Yadav","orcid":"https://orcid.org/0000-0003-0746-066X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rohan Yadav","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015051107","display_name":"Umut A. Acar","orcid":"https://orcid.org/0000-0002-2623-4986"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umut A. Acar","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047980263"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.05474896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908999800682068,"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.9725255966186523},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.9646447896957397},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.8381754159927368},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6278460025787354},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5954817533493042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5275763273239136},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.5108799338340759},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.44551539421081543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4281775951385498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39963820576667786},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1466541886329651},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10564243793487549}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9725255966186523},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.9646447896957397},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.8381754159927368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6278460025787354},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5954817533493042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5275763273239136},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.5108799338340759},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.44551539421081543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4281775951385498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39963820576667786},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1466541886329651},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10564243793487549},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3323165.3323170","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","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":11,"referenced_works":["https://openalex.org/W157973366","https://openalex.org/W164704629","https://openalex.org/W1217907795","https://openalex.org/W1990600049","https://openalex.org/W2019380637","https://openalex.org/W2126359798","https://openalex.org/W2143163611","https://openalex.org/W2147405597","https://openalex.org/W2409645877","https://openalex.org/W2613146847","https://openalex.org/W3106926726"],"related_works":["https://openalex.org/W2542507283","https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W3008959778","https://openalex.org/W2252464404","https://openalex.org/W872425053","https://openalex.org/W3151217588","https://openalex.org/W2126359798","https://openalex.org/W4245682093","https://openalex.org/W88519367"],"abstract_inverted_index":{"Subgraph":[0],"isomorphism":[1,61,88],"is":[2,30,36,56],"a":[3,31,63,80,99],"fundamental":[4],"property":[5],"of":[6,15,115],"graphs":[7],"that":[8],"requires":[9],"checking":[10],"whether":[11,59],"the":[12,84,112],"network":[13],"structure":[14],"one":[16],"graph":[17],"can":[18],"be":[19],"found":[20],"(embedded)":[21],"within":[22],"another":[23],"graph.":[24],"It":[25],"has":[26,50],"numerous":[27],"applications":[28],"and":[29,38,65],"computationally":[32],"challenging":[33],"problem:":[34],"it":[35,49],"NP-complete":[37],"known":[39,57],"algorithms":[40],"explore":[41],"an":[42],"exponentially":[43],"large":[44],"search":[45],"space.":[46],"Even":[47],"though":[48],"been":[51],"studied":[52],"extensively,":[53],"relatively":[54],"little":[55],"about":[58],"subgraph":[60,85],"accepts":[62],"theoretically":[64],"practically":[66],"efficient":[67],"parallel":[68,81,100],"solution.":[69],"In":[70],"this":[71],"paper,":[72],"we":[73],"present":[74],"our":[75,116],"ongoing":[76],"work":[77],"on":[78],"designing":[79],"algorithm":[82,101,105],"for":[83,102],"(and":[86],"graph)":[87],"problem,":[89],"which":[90],"addresses":[91],"challenges":[92],"commonly":[93],"faced":[94],"when":[95],"attempting":[96],"to":[97,107,111],"obtain":[98],"isomorphism.":[103],"Our":[104],"appears":[106],"scale":[108],"well":[109],"up":[110],"70":[113],"cores":[114],"empirical":[117],"machine.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}