arXiv Open Access 2019

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance

Takanori Maehara Kazutoshi Ando

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Takanori Maehara

Kazutoshi Ando

Format Sitasi

APA MLA BibTeX

Maehara, T., Ando, K. (2019). Optimal Algorithm to Reconstruct a Tree from a Subtree Distance. https://arxiv.org/abs/1902.08742

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓