• 1 Introduction
  • 2 Preliminaries
    • 2.1 Permutation Graphs
    • 2.2 Space Lower Bounds
    • 2.3 Succinct Data Structures
  • 3 Data Structures for Permutation Graphs
    • 3.1 Grid-Based Data Structure
    • 3.2 Array-Based Data Structure
    • 3.3 Distance and Shortest Paths
  • 4 Algorithms on Succinct Permutation Graphs
  • 5 Bipartite Permutation Graphs
    • 5.1 Data Structure
    • 5.2 Space Lower Bound
    • 5.3 Algorithms
  • 6 Circular Permutation Graphs
    • 6.1 Preliminaries
    • 6.2 Ordered CPGs and the Thrice-Unrolled PG
    • 6.3 Succinct CPGs
  • 7 Semi-Distributed Graph Representations
  • 8 Conclusion
  • References