Succinct Representations of Arbitrary Graphs

DOI10.1007/978-3-540-87744-8_33MaRDI QIDQ3541102zbMATH OpenOpenAlexFDO

Authors Arash Farzan, J. Ian Munro

Publication date 25 November 2008

Published in Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87744-8_33

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Succinct encoding of arbitrary graphs
• Succinct encodings for families of interval graphs
• Succinct representation of general unlabeled graphs
• On the succinct representation of graphs
• Succinct representations of separable graphs

Cites work

• scientific article; zbMATH DE number 1688373 (Why is no real title available?)
• scientific article; zbMATH DE number 5506222 (Why is no real title available?)
• scientific article; zbMATH DE number 2079399 (Why is no real title available?)
• Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
• Implicat Representation of Graphs
• On the Size of Succinct Indices
• On the succinct representation of graphs
• Optimal bounds for the predecessor problem and related problems
• Optimal lower bounds for rank and select indexes
• Rank/select operations on large alphabets
• Short encodings of planar graphs and maps
• Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
• Succinct indexes for strings, binary relations and multi-labeled trees

Cited in

(24)

• Succinct Encodings of Graph Isomorphism
• scientific article; zbMATH DE number 7765383 (Why is no real title available?)
• A note on succinct representations of graphs
• On the succinct representation of equivalence classes
• scientific article; zbMATH DE number 219271 (Why is no real title available?)
• On the succinct representation of graphs
• Succinct posets
• GLOUDS: representing tree-like graphs
• 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
• Succinct encodings for families of interval graphs
• Compact navigation and distance oracles for graphs with small treewidth
• Representation of graphs by OBDDs
• Succinct and Implicit Data Structures for Computational Geometry
• On compact representations of all-pairs-shortest-path-distance matrices
• Compact representation of graphs with bounded bandwidth or treedepth
• Succinct data structures for families of interval graphs
• Compact navigation and distance oracles for graphs with small treewidth
• On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
• Implementing the topological model succinctly
• I/O-efficient path traversal in succinct planar graphs
• Succinct Representation of Labeled Graphs

This page was built for publication: Succinct Representations of Arbitrary Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541102)