Range Mode and Range Median Queries on Lists and Trees

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.

• Type: Conference
• Year: 2003
• Where: ISAAC
• Authors: Danny Krizanc, Pat Morin, Michiel H. M. Smid
• Keywords: ISAAC 2003, Median Label, Preprocessing