{"id":"https://openalex.org/W2423652555","doi":"https://doi.org/10.1145/2882903.2915236","title":"Efficient Subgraph Matching by Postponing Cartesian Products","display_name":"Efficient Subgraph Matching by Postponing Cartesian Products","publication_year":2016,"publication_date":"2016-06-14","ids":{"openalex":"https://openalex.org/W2423652555","doi":"https://doi.org/10.1145/2882903.2915236","mag":"2423652555"},"language":"en","primary_location":{"id":"doi:10.1145/2882903.2915236","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2882903.2915236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 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/A5036333774","display_name":"Fei Bi","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Fei Bi","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079659938","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046220908","display_name":"Lu Qin","orcid":"https://orcid.org/0000-0001-6068-5062"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lu Qin","raw_affiliation_strings":["University of Technology, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100385498","display_name":"Wenjie Zhang","orcid":"https://orcid.org/0000-0001-6572-2600"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5036333774"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":7.4325,"has_fulltext":false,"cited_by_count":301,"citation_normalized_percentile":{"value":0.98235846,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1199","last_page":"1214"},"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.9937999844551086,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9901999831199646,"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/cartesian-product","display_name":"Cartesian product","score":0.690025269985199},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.59394371509552},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5890726447105408},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5793060660362244},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5343633890151978},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5301175117492676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.503001868724823},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.493927538394928},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4811176657676697},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.43122604489326477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42215773463249207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4212362766265869},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4109416604042053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32938352227211},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11236488819122314},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.10344338417053223}],"concepts":[{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.690025269985199},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.59394371509552},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5890726447105408},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5793060660362244},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5343633890151978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5301175117492676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.503001868724823},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.493927538394928},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4811176657676697},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.43122604489326477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42215773463249207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4212362766265869},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4109416604042053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32938352227211},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11236488819122314},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.10344338417053223},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2882903.2915236","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2882903.2915236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/121804","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/121804","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1498814251","https://openalex.org/W1574303240","https://openalex.org/W1676999057","https://openalex.org/W1975068437","https://openalex.org/W1978066268","https://openalex.org/W2011039300","https://openalex.org/W2013497015","https://openalex.org/W2035173902","https://openalex.org/W2051729070","https://openalex.org/W2083235381","https://openalex.org/W2087829218","https://openalex.org/W2100586946","https://openalex.org/W2110034858","https://openalex.org/W2112523291","https://openalex.org/W2112776329","https://openalex.org/W2118212234","https://openalex.org/W2126359798","https://openalex.org/W2136676173","https://openalex.org/W2140840007","https://openalex.org/W2141629057","https://openalex.org/W2143363350","https://openalex.org/W2147405597","https://openalex.org/W2241555812","https://openalex.org/W2254833717","https://openalex.org/W2586392344","https://openalex.org/W3137504194","https://openalex.org/W6634263952","https://openalex.org/W6637459119"],"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/W1887488684"],"abstract_inverted_index":{"In":[0,120],"this":[1,121],"paper,":[2,122],"we":[3,127],"study":[4],"the":[5,59,71,105,113,124,129,147,152,159,175,192,197,210,225,245],"problem":[6],"of":[7,16,51,62,73,131,154,196,215,228,253],"subgraph":[8,13,31,75,187],"matching":[9,32,49,60,76,102,183],"that":[10,37,58,241],"extracts":[11],"all":[12],"isomorphic":[14],"embeddings":[15],"a":[17,22,48,66,74,142,155,168,182,216,229],"query":[18,41,52,63,91,156,230],"graph":[19,25,218],"q":[20],"in":[21,90],"large":[23],"data":[24,44,93,172,201,217],"G.":[26],"The":[27],"existing":[28,198],"algorithms":[29,247],"for":[30,123],"follow":[33],"Ullmann's":[34],"backtracking":[35],"approach;":[36],"is,":[38],"iteratively":[39],"map":[40],"vertices":[42,45,64,89],"to":[43,70,98,107,157,180,250],"by":[46,116,134,145,248],"following":[47],"order":[50,61,103,184],"vertices.":[53,139],"It":[54],"has":[55],"been":[56,96],"shown":[57],"is":[65,166,224],"very":[67],"important":[68],"aspect":[69],"efficiency":[72],"algorithm.":[77],"Recently,":[78],"many":[79],"advanced":[80],"techniques,":[81],"such":[82],"as":[83],"enforcing":[84],"connectivity":[85],"and":[86,185,206,212,221,237],"merging":[87],"similar":[88],"or":[92],"graphs,":[94],"have":[95],"proposed":[97],"provide":[99],"an":[100],"effective":[101],"with":[104,174],"aim":[106],"reduce":[108],"unpromising":[109,132],"intermediate":[110],"results":[111,133],"especially":[112],"ones":[114],"caused":[115],"redundant":[117,160],"Cartesian":[118,135,148,161],"products.":[119,162],"first":[125],"time":[126],"address":[128],"issue":[130],"products":[136,149],"from":[137],"\"dissimilar\"":[138],"We":[140],"propose":[141],"new":[143,169],"framework":[144],"postponing":[146],"based":[150],"on":[151,235],"structure":[153],"minimize":[158],"Our":[163],"second":[164],"contribution":[165],"proposing":[167],"path-based":[170,199],"auxiliary":[171,200],"structure,":[173,202],"size":[176,194],"O(|E(G)|":[177],"x":[178],"|V(q)|),":[179],"generate":[181],"conduct":[186],"matching,":[188],"which":[189],"significantly":[190],"reduces":[191],"exponential":[193],"O(|V(G)||V(q)|-1)":[195],"where":[203],"V":[204,222],"(G)":[205,208],"E":[207],"are":[209],"vertex":[211,226],"edge":[213],"sets":[214],"G,":[219],"respectively,":[220],"(q)":[223],"set":[227],"$q$.":[231],"Extensive":[232],"empirical":[233],"studies":[234],"real":[236],"synthetic":[238],"graphs":[239],"demonstrate":[240],"our":[242],"techniques":[243],"outperform":[244],"state-of-the-art":[246],"up":[249],"$3$":[251],"orders":[252],"magnitude.":[254]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":47},{"year":2024,"cited_by_count":55},{"year":2023,"cited_by_count":32},{"year":2022,"cited_by_count":37},{"year":2021,"cited_by_count":53},{"year":2020,"cited_by_count":31},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}