Range Mode and Range Median Queries on Lists and Trees
classification
💻 cs.DS
keywords
listsmedianmodequeriesrangetreesalgorithmsanswer
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.