Succinct data structure for path graphs
From MaRDI portal
Publication:6178455
DOI10.1016/j.ic.2023.105124arXiv2111.04332MaRDI QIDQ6178455
Girish Balakrishnan, N. S. Narayanaswamy, Kunihiko Sadakane, Sankardeep Chakraborty
Publication date: 18 January 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.04332
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct encoding of arbitrary graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct representations of planar maps
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Clique-width and the speed of hereditary properties
- Intersection graphs of paths in a tree
- Algorithmic graph theory and perfect graphs
- Succinct navigational oracles for families of intersection graphs on a circle
- Succinct representation for (non)deterministic finite automata
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Succinct data structures for families of interval graphs
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Fast breadth-first search in still less space
- Space efficient linear time algorithms for BFS, DFS and applications
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Succinct representation of labeled graphs
- Rank and select revisited and extended
- Intersection representations of graphs by arcs
- Compact representation of graphs with bounded bandwidth or treedepth
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Graph Theory
- Rank/select operations on large alphabets
- A recognition algorithm for the total graphs
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
This page was built for publication: Succinct data structure for path graphs
