scientific article; zbMATH DE number 7765383
From MaRDI portal
Publication:6065424
DOI10.4230/lipics.isaac.2020.25arXiv2005.07644MaRDI QIDQ6065424
Yakov Nekrich, Sebastian Wild, Meng He, Kaiyu Wu, J. Ian Munro
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2005.07644
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interval graphsproper interval graphssuccinct data structuresdistance oraclesbreadth-first orderordinal treelevel ordersuccinct graph representation
Related Items (3)
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number ⋮ Succinct data structure for path graphs ⋮ Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct posets
- Ultra-succinct representation of ordered trees with applications
- Representing trees of higher degree
- Succinct representations of planar maps
- On the classes of interval graphs of limited nesting and count of lengths
- Succinct data structures for families of interval graphs
- On succinct representations of binary trees
- A uniform paradigm to succinctly encode various families of trees
- Compressed suffix trees with full functionality
- Space Efficient Suffix Trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Succinct ordinal trees with level-ancestor queries
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct ordinal trees based on tree covering
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Succinct Representations of Arbitrary Graphs
- Approximate distance oracles
- Universal Succinct Representations of Trees?
- Counting Interval Graphs
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Balanced parentheses strike back
- Shortest-path queries in static networks
- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
- Orderly Spanning Trees with Applications
- Distance Oracles beyond the Thorup--Zwick Bound
- Automata, Languages and Programming
- A unified approach to approximating resource allocation and scheduling
This page was built for publication:
