{"id":"https://openalex.org/W3020900489","doi":"https://doi.org/10.1137/20m1372925","title":"Tree-Depth and the Formula Complexity of Subgraph Isomorphism","display_name":"Tree-Depth and the Formula Complexity of Subgraph Isomorphism","publication_year":2023,"publication_date":"2023-02-28","ids":{"openalex":"https://openalex.org/W3020900489","doi":"https://doi.org/10.1137/20m1372925","mag":"3020900489"},"language":"en","primary_location":{"id":"doi:10.1137/20m1372925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1372925","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5087309847","display_name":"Deepanshu Kush","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Deepanshu Kush","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007686466","display_name":"Benjamin Rossman","orcid":"https://orcid.org/0009-0001-0247-5208"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Rossman","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, NC 27708 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC 27708 USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087309847"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.6043,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68403367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"1","first_page":"273","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9945999979972839,"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/mathematics","display_name":"Mathematics","score":0.7095420360565186},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.691451370716095},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6808949708938599},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6422216892242432},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6385381817817688},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6209819316864014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5019710063934326},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4695257246494293},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.46002286672592163},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4487622082233429},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4480496048927307},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43039679527282715},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3371717929840088},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1428118646144867}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7095420360565186},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.691451370716095},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6808949708938599},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6422216892242432},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6385381817817688},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6209819316864014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5019710063934326},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4695257246494293},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.46002286672592163},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4487622082233429},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4480496048927307},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43039679527282715},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3371717929840088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1428118646144867},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1372925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1372925","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2052210031","https://openalex.org/W2055686117","https://openalex.org/W2110128015","https://openalex.org/W2150004999","https://openalex.org/W2252464404","https://openalex.org/W2265337971","https://openalex.org/W2618244641","https://openalex.org/W2745680580","https://openalex.org/W2771115658","https://openalex.org/W2898993321","https://openalex.org/W2943672262","https://openalex.org/W2972593553","https://openalex.org/W2977768445","https://openalex.org/W2997589087","https://openalex.org/W3093250435","https://openalex.org/W3152731187","https://openalex.org/W4251265810"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2264022753","https://openalex.org/W2386314338","https://openalex.org/W2354689617","https://openalex.org/W2389993406","https://openalex.org/W2376584285","https://openalex.org/W1510249257"],"abstract_inverted_index":{".For":[0],"a":[1,21,29,83,134,156,160,225,258,334],"fixed":[2],"\"pattern\"":[3],"graph":[4,18,76],"\\(G\\),":[5],"the":[6,60,74,87,219,236,293,310,317,325],"colored":[7,31],"\\(G\\)-subgraph":[8],"isomorphism":[9],"problem":[10,39],"(denoted":[11,98],"by":[12,106],"\\(\\mathrm{SUB}(G)\\))":[13],"asks,":[14],"given":[15],"an":[16,93,117,213],"\\(n\\)-vertex":[17],"\\(H\\)":[19,27],"and":[20,48,92,140,151,268,281,313,321],"coloring":[22],"\\(V(H)":[23],"\\to":[24],"V(G)\\),":[25],"whether":[26],"contains":[28],"properly":[30],"copy":[32],"of":[33,37,45,62,70,73,90,110,137,209,229,262,288,292,306,329],"\\(G\\).":[34,77],"The":[35,206],"complexity":[36,61,89],"this":[38,79,210,307],"is":[40,57,101,116,212,224,333],"tied":[41],"to":[42,58,103],"parameterized":[43],"versions":[44],"\\(P=?\\":[46],"NP\\)":[47],"\\(L=?\\":[49],"NL\\),":[50],"among":[51],"other":[52],"questions.":[53],"An":[54,173],"overarching":[55],"goal":[56],"understand":[59],"\\(\\mathrm{SUB}(G)\\),":[63],"under":[64],"different":[65],"computational":[66],"models,":[67],"in":[68,181,184,187,218,240,290],"terms":[69],"natural":[71],"invariants":[72],"pattern":[75],"In":[78],"paper,":[80],"we":[81,233],"establish":[82,234],"close":[84],"relationship":[85],"between":[86],"formula":[88,327],"\\(\\mathrm{SUB}(G)\\)":[91,100,330],"invariant":[94],"known":[95,102,319],"as":[96],"tree-depth":[97,263],"by\\(\\mathsf{td}(G)\\)).":[99],"be":[104],"solvable":[105],"monotone":[107,127],"\\(\\textit{AC}^{0}\\)":[108],"formulas":[109,124],"size":[111,328],"\\(O(n^{\\mathsf{td}(G)})\\).":[112],"Our":[113],"main":[114],"result":[115,211],"\\(n^{\\widetilde":[118],"\\Omega":[119],"(\\mathsf{td}(G)^{1/3})}\\)":[120],"lower":[121,135,179,216,251,322],"bound":[122,136,217,252],"for":[123,165,253],"that":[125],"are":[126],"or":[128],"have":[129],"sublogarithmic":[130],"depth.":[131],"This":[132],"complements":[133],"Li,":[138],"Razborov,":[139],"Rossman":[141,242],"[SIAM":[142,243],"J.":[143,244,272],"Comput.,":[144,245],"46":[145],"(2017),":[146],"pp.":[147,248,277,302],"936\u2013971]":[148],"relating":[149],"tree-width":[150],"\\(\\textit{AC}^{\\,\\textit{0}}\\)":[152],"circuit":[153,182],"size.":[154],"As":[155],"corollary,":[157],"it":[158],"implies":[159],"stronger":[161],"homomorphism":[162,175],"preservation":[163,176],"theorem":[164,177],"first-order":[166],"logic":[167],"on":[168,298,324],"finite":[169],"structures":[170],"[B.":[171],"Rossman,":[172,283],"improved":[174],"from":[178],"bounds":[180,323],"complexity,":[183],"8th":[185],"Innovations":[186],"Theoretical":[188],"Computer":[189],"Science":[190],"Conference,":[191],"LIPIcs.":[192],"Leibniz":[193],"Int.":[194],"Proc.":[195],"Inform.":[196],"67,":[197],"Schloss":[198],"Dagstuhl.":[199],"Leibniz-Zent.":[200],"Inform.,":[201],"Wadern,":[202],"Germany,":[203],"2017,":[204],"27].":[205],"technical":[207],"core":[208],"\\(n^{\\Omega":[214],"(k)}\\)":[215],"special":[220],"case":[221],"where":[222],"\\(G\\)":[223,332],"complete":[226],"binary":[227],"tree":[228],"height":[230],"\\(k\\),":[231],"which":[232],"using":[235],"pathset":[237,311],"framework":[238,312],"introduced":[239],"B.":[241,282],"47":[246],"(2018),":[247],"1986\u20132028].":[249],"(The":[250],"general":[254],"patterns":[255],"follows":[256],"via":[257],"recent":[259],"excluded-minor":[260,286],"characterization":[261],"[W.":[264],"Czerwi\u0144ski,":[265],"W.":[266],"Nadara,":[267],"M.":[269],"Pilipczuk,":[270],"SIAM":[271],"Discrete":[273,299],"Math.,":[274],"35":[275],"(2021),":[276],"934\u2013947;":[278],"K.":[279],"Kawarabayashi":[280],"A":[284],"polynomial":[285],"approximation":[287],"treedepth,":[289],"Proceedings":[291],"2018":[294],"Annual":[295],"ACM-SIAM":[296],"Symposium":[297],"Algorithms,":[300],"2018,":[301],"234\u2013246].":[303],"Additional":[304],"results":[305],"paper":[308],"extend":[309],"improve":[314],"upon":[315],"both":[316],"best":[318],"upper":[320],"average-case":[326],"when":[331],"path.Keywordscircuit":[335],"complexitysubgraph":[336],"isomorphismtree-widthMSC":[337],"codes68Q0668Q1568Q17":[338]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}