• 1 Introduction
  • 2 Related Work
  • 3 Notation and Preliminaries
  • 4 Tree Slabbing
    • 4.1 The Farzan-Munro Algorithm
    • 4.2 Covering by Slabs
  • 5 Operations on Slabbed Trees
    • 5.1 Preorder rank/select
    • 5.2 Level-order rank/select
    • 5.3 Previous Internal Node in Level Order
  • 6 Distance Oracles and Interval Graph Representations
    • 6.1 Distances in Interval Graphs
    • 6.2 Succinct Proper Interval Graphs with Distance
    • 6.3 Distances in Circular-Arc Graphs
  • 7 Conclusion
  • A Survey of Succinct Tree Representations
  • B Tree Operations
  • References