{"id":"https://openalex.org/W2948359422","doi":"https://doi.org/10.1145/3299869.3319880","title":"Efficient Subgraph Matching","display_name":"Efficient Subgraph Matching","publication_year":2019,"publication_date":"2019-06-18","ids":{"openalex":"https://openalex.org/W2948359422","doi":"https://doi.org/10.1145/3299869.3319880","mag":"2948359422"},"language":"en","primary_location":{"id":"doi:10.1145/3299869.3319880","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3319880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","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/A5083106278","display_name":"Myoungji Han","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Myoungji Han","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100706959","display_name":"Hyunjoon Kim","orcid":"https://orcid.org/0000-0001-9906-073X"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyunjoon Kim","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102375302","display_name":"Geonmo Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Geonmo Gu","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kunsoo Park","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035744252","display_name":"Wook-Shin Han","orcid":"https://orcid.org/0000-0001-9206-9563"},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wook-Shin Han","raw_affiliation_strings":["Pohang University of Science and Technology (POSTECH), Pohang, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pohang University of Science and Technology (POSTECH), Pohang, South Korea","institution_ids":["https://openalex.org/I123900574"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4232,"has_fulltext":false,"cited_by_count":192,"citation_normalized_percentile":{"value":0.97756153,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1429","last_page":"1446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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.9930999875068665,"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.8231231570243835},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.7294678092002869},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6433384418487549},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.6312682628631592},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5822498202323914},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5327971577644348},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4986393451690674},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4710552394390106},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4475232660770416},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4427383840084076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4410642385482788},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4243139326572418},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41680869460105896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3778838515281677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2807005047798157},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26210877299308777},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.2617951035499573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2282465398311615},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12369924783706665}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8231231570243835},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.7294678092002869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6433384418487549},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.6312682628631592},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5822498202323914},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5327971577644348},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4986393451690674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4710552394390106},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4475232660770416},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4427383840084076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4410642385482788},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4243139326572418},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41680869460105896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3778838515281677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2807005047798157},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26210877299308777},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2617951035499573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2282465398311615},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12369924783706665},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3299869.3319880","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3319880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","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":54,"referenced_works":["https://openalex.org/W993733874","https://openalex.org/W1507039213","https://openalex.org/W1525887080","https://openalex.org/W1978066268","https://openalex.org/W1982177147","https://openalex.org/W2003021478","https://openalex.org/W2011039300","https://openalex.org/W2011632873","https://openalex.org/W2012066443","https://openalex.org/W2015977145","https://openalex.org/W2016056456","https://openalex.org/W2035173902","https://openalex.org/W2052899946","https://openalex.org/W2055043387","https://openalex.org/W2055898276","https://openalex.org/W2056899820","https://openalex.org/W2058880662","https://openalex.org/W2062705952","https://openalex.org/W2100586946","https://openalex.org/W2101196063","https://openalex.org/W2104644740","https://openalex.org/W2110034858","https://openalex.org/W2118212234","https://openalex.org/W2118762603","https://openalex.org/W2126359798","https://openalex.org/W2132285256","https://openalex.org/W2136676173","https://openalex.org/W2140840007","https://openalex.org/W2141629057","https://openalex.org/W2143363350","https://openalex.org/W2143406303","https://openalex.org/W2147405597","https://openalex.org/W2161843183","https://openalex.org/W2164292538","https://openalex.org/W2167429959","https://openalex.org/W2198266398","https://openalex.org/W2203972201","https://openalex.org/W2241555812","https://openalex.org/W2254833717","https://openalex.org/W2293542641","https://openalex.org/W2296148711","https://openalex.org/W2340222647","https://openalex.org/W2423652555","https://openalex.org/W2546689575","https://openalex.org/W2578829886","https://openalex.org/W2782973036","https://openalex.org/W2786851308","https://openalex.org/W2798660790","https://openalex.org/W2809235938","https://openalex.org/W2898087046","https://openalex.org/W2950670108","https://openalex.org/W2964293433","https://openalex.org/W4246219036","https://openalex.org/W6630550951"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2542507283","https://openalex.org/W2886672068","https://openalex.org/W1512756268","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W2035609387","https://openalex.org/W2566098902","https://openalex.org/W1544562508"],"abstract_inverted_index":{"Subgraph":[0],"matching":[1,53,81,128],"(or":[2],"subgraph":[3,24,149],"isomorphism)":[4],"is":[5,85],"one":[6],"of":[7,66,168,172,180],"the":[8,56,62,67,95,160,181],"fundamental":[9],"problems":[10],"in":[11,91,170,178],"graph":[12,37,121],"analysis.":[13],"Extensive":[14,151],"research":[15],"has":[16],"been":[17],"done":[18],"to":[19,74,109,142,166],"develop":[20],"practical":[21],"solutions":[22],"for":[23,42,45,148],"matching.":[25,150],"The":[26],"state-of-the-art":[27],"algorithms":[28],"such":[29],"as":[30,175,177],"\\textsfCFL-Match":[31],"and":[32,49,78,123,133],"\\textsfTurbo\\textsubscriptiso":[33],"convert":[34],"a":[35,39,51,79,118,124,143],"query":[36,47,69],"into":[38],"spanning":[40,57,63],"tree":[41,64],"obtaining":[43,50],"candidates":[44],"each":[46],"vertex":[48],"good":[52],"order":[54,129],"with":[55,130,153],"tree.":[58],"However,":[59],"by":[60,136,164],"using":[61],"instead":[65],"original":[68],"graph,":[70,125],"it":[71],"could":[72],"lead":[73,141],"lower":[75],"pruning":[76,135],"power":[77],"sub-optimal":[80],"order.":[82],"Another":[83],"limitation":[84],"that":[86,157],"they":[87],"perform":[88],"redundant":[89],"computation":[90],"search":[92],"without":[93],"utilizing":[94],"knowledge":[96],"learned":[97],"from":[98],"past":[99],"computation.":[100],"In":[101],"this":[102],"paper,":[103],"we":[104],"introduce":[105],"three":[106],"novel":[107],"concepts":[108],"address":[110],"these":[111],"inherent":[112],"limitations:":[113],"1)":[114],"dynamic":[115],"programming":[116],"between":[117],"directed":[119],"acyclic":[120],"(DAG)":[122],"2)":[126],"adaptive":[127],"DAG":[131],"ordering,":[132],"3)":[134],"failing":[137],"sets,":[138],"which":[139],"together":[140],"much":[144],"faster":[145],"algorithm":[146],"\\textsfDAF":[147,158],"experiments":[152],"real":[154],"datasets":[155],"show":[156],"outperforms":[159],"fastest":[161],"existing":[162],"solution":[163],"up":[165],"orders":[167],"magnitude":[169],"terms":[171,179],"recursive":[173],"calls":[174],"well":[176],"elapsed":[182],"time.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":41},{"year":2024,"cited_by_count":41},{"year":2023,"cited_by_count":27},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":33},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}