Subtree isomorphism revisited

DOI10.1137/1.9781611974331.CH88MaRDI QIDQ4575669zbMATH OpenOpenAlexFDO

Authors Amir Abboud, Artūrs Bačkurs, Thomas Dueholm Hansen, Or Zamir, Virginia Vassilevska Williams

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.04622

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: The Subtree Isomorphism 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., ordered trees, near-linear time algorithms are known, but for the general case truly subquadratic algorithms remain elusive. 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). 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: -- Even for binary, rooted trees, a truly subquadratic algorithm refutes SETH. -- Even for rooted trees of depth $O(loglogn)$, where $n$ is the total number of vertices, a truly subquadratic algorithm refutes SETH. -- For every constant $d$, there is a constant $epsilo{n}_d>0$ and a randomized, truly subquadratic algorithm for degree-$d$ rooted trees of depth at most $(1+epsilo{n}_d)lo{g}_{d}n$. In particular, there is an $O(min2.85^h,n^2)$ algorithm for binary trees of depth $h$. Our reductions utilize new "tree gadgets" 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.

Recommendations

• Subtree isomorphism revisited
• Faster Subtree Isomorphism
• Strings, trees, and patterns
• Faster algorithms for finding and counting subgraphs
• A note on the subtree isomorphism for ordered trees and related problems

Cited in

(12)

• Tighter connections between Formula-SAT and shaving logs
• scientific article; zbMATH DE number 7561381 (Why is no real title available?)
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas
• Orthogonal vectors indexing
• On the subtree isomorphism problem for ordered trees
• New and improved algorithms for unordered tree inclusion
• Towards hardness of approximation for polynomial time problems
• Isomorphism Types of Trees
• Strings, trees, and patterns
• Subtree isomorphism is in random NC
• Faster Subtree Isomorphism
• Subtree isomorphism revisited

This page was built for publication: Subtree isomorphism revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575669)