Subtree Isomorphism Revisited

DOI10.1137/1.9781611974331.ch88zbMath1409.68196arXiv1510.04622OpenAlexW4300885461MaRDI QIDQ4575669

Or Zamir, Amir Abboud, Thomas Dueholm Hansen, Artūrs Bačkurs, 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

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

Related Items (6)

Unnamed Item ⋮ Unnamed Item ⋮ New and improved algorithms for unordered tree inclusion ⋮ The Orthogonal Vectors Conjecture for Branching Programs and Formulas ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Subtree Isomorphism Revisited