Top-k color queries on tree paths
Document Type
Conference Proceeding
Publication Date
1-1-2013
Abstract
We present a data structure for the following problem: Given a tree T, with each of its nodes assigned a color in a totally ordered set, preprocess T to efficiently answer queries for the top k distinct colors on the path between two nodes, reporting the colors sorted in descending order. Our data structure requires linear space of O (n) words and answers queries in O(k) time. © Springer International Publishing 2013.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
109
Last Page
115
Recommended Citation
Durocher, S., Shah, R., Skala, M., & Thankachan, S. (2013). Top-k color queries on tree paths. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8214 LNCS, 109-115. https://doi.org/10.1007/978-3-319-02432-5_15
