Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
From MaRDI portal
Publication:6610090
DOI10.1142/s012905412341006xzbMATH Open1547.05292MaRDI QIDQ6610090
Kunihiko Sadakane, Seungbum Jo, Sankardeep Chakraborty, Srinivasa Rao Satti
Publication date: 24 September 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Succinct encoding of arbitrary graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Structure and linear time recognition of 3-leaf powers
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- On the succinct representation of equivalence classes
- A uniform paradigm to succinctly encode various families of trees
- Enumeration and limit laws for series-parallel graphs
- Compressed suffix trees with full functionality
- Succinct encodings for families of interval graphs
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION
- Succinct Representations of Ordinal Trees
- Succinct Representations of Separable Graphs
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- The Recognition of Series Parallel Digraphs
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- An Exact Enumeration of Distance-Hereditary Graphs
- Enumeration of labeled block-cactus graphs
- Succinct data structures for bounded clique-width graphs
This page was built for publication: Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
