Succinct Representations of Arbitrary Graphs

DOI10.1007/978-3-540-87744-8_33zbMath1158.68428OpenAlexW1599317246MaRDI QIDQ3541102

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

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

Related Items (9)

GLOUDS: representing tree-like graphs ⋮ On the succinct representation of equivalence classes ⋮ Succinct encoding of arbitrary graphs ⋮ Succinct representation of labeled graphs ⋮ Unnamed Item ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ I/O-efficient path traversal in succinct planar graphs ⋮ Succinct and Implicit Data Structures for Computational Geometry

Cites Work

• On the succinct representation of graphs
• Short encodings of planar graphs and maps
• Optimal bounds for the predecessor problem and related problems
• Optimal lower bounds for rank and select indexes
• On the Size of Succinct Indices
• Rank/select operations on large alphabets
• Implicat Representation of Graphs
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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