{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:51:24Z","timestamp":1782971484871,"version":"3.54.5"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T00:00:00Z","timestamp":1529107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BSF","award":["BSF:2012338"],"award-info":[{"award-number":["BSF:2012338"]}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Carlsberg Foundation","award":["CF14-0617"],"award-info":[{"award-number":["CF14-0617"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1417238 and CCF-1514339"],"award-info":[{"award-number":["CCF-1417238 and CCF-1514339"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IBM Ph.D. Fellowship"},{"DOI":"10.13039\/501100005386","name":"Israeli Centers of Research Excellence","doi-asserted-by":"crossref","award":["Center No. 4\/11"],"award-info":[{"award-number":["Center No. 4\/11"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2018,7,31]]},"abstract":"<jats:p>\n            The\n            <jats:italic>Subtree Isomorphism<\/jats:italic>\n            problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g.,\n            <jats:italic>ordered trees<\/jats:italic>\n            , near-linear time algorithms are known, but for the general case truly subquadratic algorithms remain elusive.\n          <\/jats:p>\n          <jats:p>Our first result is a reduction from the Orthogonal Vectors problem to Subtree Isomorphism, showing that a truly subquadratic algorithm for the latter refutes the Strong Exponential Time Hypothesis (SETH).<\/jats:p>\n          <jats:p>In light of this conditional lower bound, we focus on natural special cases for which no truly subquadratic algorithms are known. We classify these cases against the quadratic barrier, showing in particular that:<\/jats:p>\n          <jats:p>\u2022 Even for binary, rooted trees, a truly subquadratic algorithm refutes SETH.<\/jats:p>\n          <jats:p>\n            \u2022 Even for rooted trees of depth\n            <jats:italic>O<\/jats:italic>\n            (log log\n            <jats:italic>n<\/jats:italic>\n            ), where\n            <jats:italic>n<\/jats:italic>\n            is the total number of vertices, a truly subquadratic algorithm refutes SETH.\n          <\/jats:p>\n          <jats:p>\n            \u2022 For every constant\n            <jats:italic>d<\/jats:italic>\n            , there is a constant \u03b5\n            <jats:sub>\n              <jats:italic>d<\/jats:italic>\n            <\/jats:sub>\n            &gt; 0 and a randomized, truly subquadratic algorithm for degree-\n            <jats:italic>d<\/jats:italic>\n            rooted trees of depth at most (1+ \u03b5\n            <jats:sub>\n              <jats:italic>d<\/jats:italic>\n            <\/jats:sub>\n            ) log\n            <jats:sub>\n              <jats:italic>d<\/jats:italic>\n            <\/jats:sub>\n            <jats:italic>n<\/jats:italic>\n            . In particular, there is an\n            <jats:italic>O<\/jats:italic>\n            (min { 2.85\n            <jats:sup>\n              <jats:italic>h<\/jats:italic>\n            <\/jats:sup>\n            ,\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            }) algorithm for binary trees of depth\n            <jats:italic>h<\/jats:italic>\n            .\n          <\/jats:p>\n          <jats:p>Our reductions utilize new \u201ctree gadgets\u201d that are likely useful for future SETH-based lower bounds for problems on trees. Our upper bounds apply a folklore result from randomized decision tree complexity.<\/jats:p>","DOI":"10.1145\/3093239","type":"journal-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T12:28:11Z","timestamp":1529324891000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Subtree Isomorphism Revisited"],"prefix":"10.1145","volume":"14","author":[{"given":"Amir","family":"Abboud","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arturs","family":"Backurs","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas Dueholm","family":"Hansen","sequence":"additional","affiliation":[{"name":"Aarhus University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Virginia","family":"Vassilevska Williams","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Or","family":"Zamir","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.14"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722241"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_2_1_4_1","volume-title":"Virginia Vassilevska Williams, and Joshua R. Wang","author":"Abboud Amir","year":"2016"},{"key":"e_1_2_1_5_1","volume-title":"Virginia Vassilevska Williams, and Oren Weimann","author":"Abboud Amir","year":"2014"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00278-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.012"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958033.1958051"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.76"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.15"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793256223"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90030-7"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258553"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509992"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382704"},{"key":"e_1_2_1_18_1","volume-title":"The hardness of subgraph isomorphism. CoRR abs\/1504.02876","author":"Cygan Marek","year":"2015"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010023"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00054-X"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174653"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_2_1_23_1","first-page":"45","article-title":"Matching structure and semantics: A survey on graph-based pattern matching","volume":"6","author":"Gallagher Brian","year":"2006","journal-title":"AAAI FS"},{"key":"e_1_2_1_24_1","volume-title":"Johnson","author":"Garey Michael R.","year":"2002"},{"key":"e_1_2_1_25_1","unstructured":"Archontia C. Giannopoulou George B. Mertzios and Rolf Niedermeier. 2015. Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. (unpublished)  Archontia C. Giannopoulou George B. Mertzios and Rolf Niedermeier. 2015. Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. (unpublished)"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90081-M"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"Gusfield Dan","DOI":"10.1017\/CBO9780511574931"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"e_1_2_1_29_1","volume-title":"Hopcroft and Robert Endre Tarjan","author":"John","year":"1972"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796325"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796430"},{"key":"e_1_2_1_34_1","volume-title":"Complexity of Computer Computations","author":"Karp Richard M."},{"key":"e_1_2_1_35_1","volume-title":"Yao","author":"Khanna Sanjeev","year":"1995"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791218202"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63475"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/648217.751060"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90011-X"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90170-1"},{"key":"e_1_2_1_41_1","volume-title":"Plummer","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"2009"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 31st STACS. 542--553","author":"Marx D\u00e1niel","year":"2014"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90687-B"},{"key":"e_1_2_1_44_1","first-page":"273","article-title":"An algorithm for subtree identification","volume":"10","author":"Matula David W.","year":"1968","journal-title":"SIAM Rev."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70324-8"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.40"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the 21st SODA","volume":"10","author":"Patrascu Mihai","year":"2010"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206053"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.44"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1044"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"e_1_2_1_53_1","volume-title":"Algorithms on Trees and Graphs","author":"Valiente Gabriel"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90046-X"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.023"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90062-0"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218082"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90136-J"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3093239","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3093239","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3093239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:39Z","timestamp":1750217439000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3093239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,16]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7,31]]}},"alternative-id":["10.1145\/3093239"],"URL":"https:\/\/doi.org\/10.1145\/3093239","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,16]]},"assertion":[{"value":"2016-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}