Succinct representations of separable graphs

DOI10.1007/978-3-642-13509-5_13MaRDI QIDQ3575243zbMATHOpenAlexFDO

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

(22)

• Succinct encoding of binary strings representing triangulations
• Navigating planar topologies in near-optimal space and time
• Succinct Representations of Arbitrary Graphs
• Compact navigation and distance oracles for graphs with small treewidth
• Succinct representation of labeled graphs
• Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
• Succinct encodings for families of interval graphs
• Dynamic compact planar embeddings
• Succinct data structures for bounded clique-width graphs
• Succinct representations of planar maps
• Succinct encoding of arbitrary graphs
• Succinct Encodings of Graph Isomorphism
• An approach to emulating separable graphs
• Compact representation of graphs with bounded bandwidth or treedepth
• Compact navigation and distance oracles for graphs with small treewidth
• A note on succinct representations of graphs
• Compact representation of graphs of small clique-width
• Near-optimal distance emulator for planar graphs
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
• scientific article; zbMATH DE number 2079399 (Why is no real title available?)
• Succinct Representation of Labeled Graphs
• On the succinct representation of graphs

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)