Succinct representations of separable graphs
From MaRDI portal
Recommendations
Cited in
(27)- Navigating planar topologies in near-optimal space and time
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Compact I/O-efficient representation of separable graphs and optimal tree layouts
- Succinct representation of labeled graphs
- Succinct encodings for families of interval graphs
- Succinct encoding of binary strings representing triangulations
- Compact representation of graphs with bounded bandwidth or treedepth
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct Representations of Arbitrary Graphs
- Succinct encoding of arbitrary graphs
- An approach to emulating separable graphs
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- Compact navigation and distance oracles for graphs with small treewidth
- A note on succinct representations of graphs
- Near-optimal distance emulator for planar graphs
- Succinct Representation of Labeled Graphs
- Succinct Encodings of Graph Isomorphism
- Succinct data structures for bounded clique-width graphs
- Dynamic compact planar embeddings
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Space-efficient graph coarsening with applications to succinct planar encodings
- Succinct planar encoding with minor operations
- Co-lexicographically ordering automata and regular languages. I
- Compact representation of graphs of small clique-width
- Succinct data structures for Baxter permutation and related families
- On the succinct representation of graphs
- Succinct representations of planar maps
This page was built for publication: Succinct representations of separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575243)
