Succinct representations of separable graphs
DOI10.1007/978-3-642-13509-5_13zbMATH Open1286.68368OpenAlexW1516961187MaRDI QIDQ3575243FDOQ3575243
Authors: Guy E. Blelloch, Arash Farzan 
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_13
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (23)
- Succinct Encodings of Graph Isomorphism
- A note on succinct representations of graphs
- Succinct representations of planar maps
- Compact representation of graphs of small clique-width
- On the succinct representation of graphs
- Succinct representation of labeled graphs
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Title not available (Why is that?)
- Succinct encodings for families of interval graphs
- Succinct encoding of arbitrary graphs
- An approach to emulating separable graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct encoding of binary strings representing triangulations
- Fast and compact planar embeddings
- Succinct Representations of Arbitrary Graphs
- Succinct data structures for bounded clique-width graphs
- Compact representation of graphs with bounded bandwidth or treedepth
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct Representation of Labeled Graphs
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Dynamic compact planar embeddings
- Navigating planar topologies in near-optimal space and time
- Title not available (Why is that?)
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)
