Computing the agreement of trees with bounded degrees

DOI10.1007/3-540-60313-1_157zbMath1524.68434MaRDI QIDQ6102316

Teresa M. Przytycka, Martin Farach, Mikkel Thorup

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)

Related Items

Computing the unrooted maximum agreement subtree in sub-quadratic time ⋮ Analysis of the Period Recovery Error Bound ⋮ An improved algorithm for the maximum agreement subtree problem

Cites Work

• Kaikoura tree theorems: Computing the maximum agreement subtree
• A priority queue in which initialization and queue operations takeO(loglogD) time
• Faster Scaling Algorithms for Network Problems
• Unnamed Item
• Unnamed Item