Range Mode and Range Median Queries on Lists and Trees

Simple item page
dc.creatorKrizanc, Danny
dc.creatorMorin, Pat
dc.creatorSmid, Michiel
dc.date2003-07-12
dc.date.accessioned2026-07-07T03:20:02Z
dc.date.available2026-07-07T03:20:02Z
dc.descriptionWe 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.
dc.description12 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/cs/0307034
dc.identifierhttp://arxiv.org/abs/cs/0307034
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31697
dc.subjectData Structures and Algorithms
dc.subjectE.1
dc.titleRange Mode and Range Median Queries on Lists and Trees
dc.typetext

Files

Collections

arXiv