Range Mode and Range Median Queries on Lists and Trees
Krizanc, Danny · Morin, Pat · Smid, Michiel
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.