Path Queries on Functions

Abstract

Let f : [1..n] → [1..n] be a function, and ` : [1..n] → [1..σ] indicate a label assigned to each element of the domain. We design several compact data structures that answer various queries on the labels of paths in f . For example, we can find the minimum label in f(i) for a given i and any k ≥ 0 in a given range [k1..k2], using n lgn+O(n) bits, or the… (More)
DOI: 10.4230/LIPIcs.CPM.2017.5

4 Figures and Tables

Topics

  • Presentations referencing similar topics