The centroid of a tree is a node that, when removed, breaks the tree in connected components of size at most half of that of the original tree. By recursing this procedure on the components, one obtains the centroid decomposition of the tree, also known as centroid tree. The centroid tree has logarithmic height and its construction is a powerful pre-processing step in several tree-processing algorithms. The folklore recursive algorithm for computing the centroid tree runs in time. To the best of our knowledge, the only result claiming O(n) time is unpublished and relies on (dynamic) heavy path decomposition of the original tree. In this short paper, we describe a new simple and practical linear-time algorithm for the problem based on the idea of applying the folklore algorithm to a suitable decomposition of the original tree.
|Data di pubblicazione:||2019|
|Titolo:||A New Linear-Time Algorithm for Centroid Decomposition|
|Titolo del libro:||String Processing and Information Retrieval: 26th International Symposium, SPIRE 2019, Proceedings|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-030-32686-9_20|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto: