Range Mode and Range Median Queries on Lists and Trees
Data Structures and Algorithms
2007-05-23 v1
Abstract
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v.
Cite
@article{arxiv.cs/0307034,
title = {Range Mode and Range Median Queries on Lists and Trees},
author = {Danny Krizanc and Pat Morin and Michiel Smid},
journal= {arXiv preprint arXiv:cs/0307034},
year = {2007}
}
Comments
12 pages, 6 figures