Succinct Representations of Separable Graphs
From MaRDI portal
Publication:3575243
DOI10.1007/978-3-642-13509-5_13zbMath1286.68368MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Unnamed Item, Fast and compact planar embeddings, Compact navigation and distance oracles for graphs with small treewidth, Compact representation of graphs of small clique-width, Navigating planar topologies in near-optimal space and time, 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, Compact Navigation and Distance Oracles for Graphs with Small Treewidth