Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
Data Structures and Algorithms
2019-02-26 v1
Abstract
This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time algorithm that finds such a representation. This algorithm achieves the optimal time complexity.
Cite
@article{arxiv.1902.08742,
title = {Optimal Algorithm to Reconstruct a Tree from a Subtree Distance},
author = {Takanori Maehara and Kazutoshi Ando},
journal= {arXiv preprint arXiv:1902.08742},
year = {2019}
}