{"id":"https://openalex.org/W4324266469","doi":"https://doi.org/10.1145/3579654.3579688","title":"Fast and Exact Subgraph Isomorphism Querying: Using Embedding and Searching Techniques","display_name":"Fast and Exact Subgraph Isomorphism Querying: Using Embedding and Searching Techniques","publication_year":2022,"publication_date":"2022-12-23","ids":{"openalex":"https://openalex.org/W4324266469","doi":"https://doi.org/10.1145/3579654.3579688"},"language":"en","primary_location":{"id":"doi:10.1145/3579654.3579688","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579654.3579688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","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/A5003386825","display_name":"Zihao Li","orcid":"https://orcid.org/0000-0001-7987-1770"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["CN","US"],"is_corresponding":true,"raw_author_name":"Zihao Li","raw_affiliation_strings":["Zhejiang University-University of Illinois at Urbana-Champaign Institute, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University-University of Illinois at Urbana-Champaign Institute, China","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036662795","display_name":"Jiazhen Xu","orcid":"https://orcid.org/0000-0002-2686-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Jiazhen Xu","raw_affiliation_strings":["Zhejiang University-University of Illinois at Urbana-Champaign Institute, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University-University of Illinois at Urbana-Champaign Institute, China","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085375979","display_name":"Baoyi He","orcid":"https://orcid.org/0000-0001-7404-2009"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Baoyi He","raw_affiliation_strings":["Zhejiang University-University of Illinois at Urbana-Champaign Institute, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University-University of Illinois at Urbana-Champaign Institute, China","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000905974","display_name":"Klaus\u2010Dieter Schewe","orcid":"https://orcid.org/0000-0002-8309-1803"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Klaus-Dieter Schewe","raw_affiliation_strings":["Zhejiang University-University of Illinois at Urbana-Champaign Institute, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University-University of Illinois at Urbana-Champaign Institute, China","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003386825"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16516337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9994999766349792,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"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/T12127","display_name":"Software System Performance and Reliability","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.9423625469207764},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8878815174102783},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7810640931129456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6365832686424255},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5470675826072693},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5272318720817566},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5177925825119019},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.490562379360199},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47536295652389526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32781267166137695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2827105224132538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2658073306083679},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2006702423095703},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13311338424682617},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10242092609405518}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9423625469207764},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8878815174102783},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7810640931129456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6365832686424255},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5470675826072693},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5272318720817566},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5177925825119019},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.490562379360199},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47536295652389526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32781267166137695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2827105224132538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2658073306083679},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2006702423095703},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13311338424682617},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10242092609405518}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3579654.3579688","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3579654.3579688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","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":22,"referenced_works":["https://openalex.org/W398859631","https://openalex.org/W2154851992","https://openalex.org/W2393319904","https://openalex.org/W2594458886","https://openalex.org/W2747329762","https://openalex.org/W2888221391","https://openalex.org/W2913192763","https://openalex.org/W2962756421","https://openalex.org/W3012361514","https://openalex.org/W3043790937","https://openalex.org/W3091993229","https://openalex.org/W3101413764","https://openalex.org/W3104097132","https://openalex.org/W3139337630","https://openalex.org/W3156741084","https://openalex.org/W3186836030","https://openalex.org/W4225773884","https://openalex.org/W4226303916","https://openalex.org/W4283205711","https://openalex.org/W4285234746","https://openalex.org/W4294690989","https://openalex.org/W4296564027"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W2915540008","https://openalex.org/W1965191464","https://openalex.org/W2128390795","https://openalex.org/W231720905","https://openalex.org/W84561889","https://openalex.org/W2540418660","https://openalex.org/W167435155"],"abstract_inverted_index":{"Subgraph":[0],"isomorphism":[1,71],"querying":[2],"finds":[3],"if":[4],"there":[5],"is":[6,38,58,129],"any":[7],"instance":[8],"of":[9,75,78],"a":[10,19,98],"given":[11],"pattern":[12,115],"within":[13],"the":[14,49,54,73,83,88,117],"data":[15,118],"graph,":[16],"and":[17,35,57],"has":[18],"wide":[20],"applications":[21],"in":[22,116,133],"all":[23],"fields":[24],"related":[25],"to":[26,131,136],"graphs,":[27],"such":[28],"as":[29],"databases,":[30],"social":[31],"network":[32],"analysis,":[33],"chemistry":[34],"biology.":[36],"It":[37],"well-known":[39],"that":[40],"this":[41,94],"task":[42],"can":[43,110],"be":[44],"done":[45,67],"by":[46],"brute-force,":[47],"but":[48],"complexity":[50],"increases":[51],"exponentially":[52],"with":[53,72],"graph":[55,89,119],"size":[56,90],"proven":[59],"an":[60,113,138],"NP-hard":[61],"problem.":[62],"Many":[63],"works":[64],"have":[65],"been":[66],"on":[68,106],"accelerating":[69],"subgraph":[70],"sacrifice":[74],"accuracy,":[76],"most":[77],"which":[79,109,128],"still":[80],"suffer":[81],"from":[82],"inherent":[84],"difficulty,":[85],"especially":[86],"when":[87],"get":[91,137],"large.":[92],"In":[93],"paper":[95],"we":[96],"propose":[97,124],"novel":[99],"method,":[100],"named":[101],"SubQHS":[102],"(Subgraph":[103],"Querying":[104],"based":[105],"Heuristic":[107],"Search),":[108],"quickly":[111],"find":[112],"existing":[114],"using":[120],"heuristic.":[121],"We":[122],"also":[123],"its":[125],"variant":[126],"SubQHS-T,":[127],"guaranteed":[130],"terminate":[132],"polynomial":[134],"time":[135],"approximate":[139],"result.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}