no code implementations • 1 Mar 2021 • Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
We address the question "what is the additional cost of determining approximate locations for non-key queries"?
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2
no code implementations • 1 Mar 2021 • Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
We present a simple $O(n^4)$-time algorithm for computing optimal search trees with two-way comparisons.
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2
no code implementations • 15 May 2020 • Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu
We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between preorder (i. e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time.
Data Structures and Algorithms
no code implementations • 2 May 2015 • Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
Until this paper, the problem of finding an optimal search tree using 2-way comparisons remained open -- poly-time algorithms were known only for restricted variants.
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45, E.4; G.1.6; G.2.2; H.3.1; I.4.2
