Succinct Representations of Arbitrary Graphs
From MaRDI portal
Publication:3541102
DOI10.1007/978-3-540-87744-8_33zbMATH Open1158.68428OpenAlexW1599317246MaRDI QIDQ3541102FDOQ3541102
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- On the succinct representation of graphs
- Succinct indexes for strings, binary relations and multi-labeled trees
- Rank/select operations on large alphabets
- Optimal bounds for the predecessor problem and related problems
- Implicat Representation of Graphs
- Title not available (Why is that?)
- Optimal lower bounds for rank and select indexes
- On the Size of Succinct Indices
- Short encodings of planar graphs and maps
- Title not available (Why is that?)
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
Cited In (24)
- Succinct Encodings of Graph Isomorphism
- Title not available (Why is that?)
- A note on succinct representations of graphs
- On the succinct representation of equivalence classes
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Succinct encodings for families of interval graphs
- Succinct encoding of arbitrary 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
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct data structures for families of interval graphs
- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
- Implementing the topological model succinctly
- Succinct Representation of Labeled Graphs
- I/O-efficient path traversal in succinct planar 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)
