Succinct encoding of arbitrary graphs
DOI10.1016/J.TCS.2013.09.031zbMATH Open1407.68356OpenAlexW1993294649MaRDI QIDQ391972FDOQ391972
Authors: Arash Farzan, J. Ian Munro 
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.031
Recommendations
- Succinct Representations of Arbitrary Graphs
- Succinct Encodings of Graph Isomorphism
- On the succinct representation of graphs
- Succinct representations of graphs
- A note on succinct representations of graphs
- Bounded-depth succinct encodings and the structure they imply on graphs
- Succinct encodings for families of interval graphs
- Succinct representations of separable graphs
- scientific article; zbMATH DE number 2032369
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)
Cites Work
- Title not available (Why is that?)
- New lower and upper bounds for representing sequences
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- An introduction to Kolmogorov complexity and its applications
- On the succinct representation of graphs
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- 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?)
- Low redundancy in static dictionaries with constant query time
- Short encodings of planar graphs and maps
- Succinct Representations of Arbitrary Graphs
- Optimal trade-offs for succinct string indexes
- Title not available (Why is that?)
- Membership in Constant Time and Almost-Minimum Space
- Title not available (Why is that?)
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Automata, Languages and Programming
Cited In (22)
- Succinct Encodings of Graph Isomorphism
- Adjacency labeling schemes and induced-universal graphs
- A note on succinct representations of graphs
- Encoding data structures
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Frameworks for designing in-place graph algorithms
- Title not available (Why is that?)
- On the succinct representation of graphs
- Succinct data structure for path graphs
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Succinct representations for (non)deterministic finite automata
- Succinct posets
- Succinct encodings for families of interval graphs
- Title not available (Why is that?)
- Succinct encoding of binary strings representing triangulations
- Succinct Representations of Arbitrary Graphs
- Succinct data structures for bounded clique-width graphs
- Compact representation of graphs with bounded bandwidth or treedepth
- Succinct data structures for families of interval graphs
- Succinct navigational oracles for families of intersection graphs on a circle
- Succinct representation for (non)deterministic finite automata
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
This page was built for publication: Succinct encoding of arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391972)
