Succinct representations of separable graphs

DOI10.1007/978-3-642-13509-5_13MaRDI QIDQ3575243zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 2079399
• Succinct representations of planar maps
• On the succinct representation of graphs
• Navigating planar topologies in near-optimal space and time
• Succinct representation of labeled graphs

Cited in

(26)

• Succinct Encodings of Graph Isomorphism
• Succinct planar encoding with minor operations
• 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
• Near-optimal distance emulator for planar graphs
• Co-lexicographically ordering automata and regular languages. I
• Succinct representation of labeled graphs
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• scientific article; zbMATH DE number 2079399 (Why is no real title available?)
• Succinct encoding of arbitrary graphs
• Space-efficient graph coarsening with applications to succinct planar encodings
• Succinct encodings for families of interval graphs
• Compact navigation and distance oracles for graphs with small treewidth
• An approach to emulating separable graphs
• Succinct encoding of binary strings representing triangulations
• Succinct Representations of Arbitrary Graphs
• Compact representation of graphs with bounded bandwidth or treedepth
• Succinct data structures for bounded clique-width graphs
• Succinct data structures for Baxter permutation and related families
• 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
• Navigating planar topologies in near-optimal space and time
• Dynamic compact planar embeddings

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)