Graph compression and the zeros of polynomials
From MaRDI portal
Publication:834888
DOI10.1016/j.ipl.2004.06.004zbMath1173.68610MaRDI QIDQ834888
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.004
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)
Cites Work
- Representation of graphs
- Succinct representation of general unlabeled graphs
- Succinct Representation of Balanced Parentheses and Static Trees
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item