Range Mode and Range Median Queries on Lists and Trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages, 6 figures

Keywords

Data Structures and Algorithms, E.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31697

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0307034
 http://arxiv.org/abs/cs/0307034

Collections

arXiv