Succinct Representations of Separable Graphs
From MaRDI portal
Publication:3575243
DOI10.1007/978-3-642-13509-5_13zbMath1286.68368OpenAlexW1516961187MaRDI QIDQ3575243
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
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)
Related Items (9)
Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Succinct encoding of binary strings representing triangulations ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Unnamed Item ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ Compact representation of graphs of small clique-width ⋮ Fast and compact planar embeddings ⋮ Navigating planar topologies in near-optimal space and time
This page was built for publication: Succinct Representations of Separable Graphs
