Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
From MaRDI portal
Publication:975433
DOI10.1016/j.ipl.2008.04.017zbMath1191.68298OpenAlexW2152214748MaRDI QIDQ975433
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.017
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)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the succinct representation of graphs
- Short encodings of planar graphs and maps
- Succinct representation of general unlabeled graphs
- A Census of Planar Triangulations
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Efficient Coding of Nontriangular Mesh Connectivity
- Compressing the Property Mapping of Polygon Meshes
- Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
- A Census of Planar Maps
This page was built for publication: Quick encoding of plane graphs in \(\log _{2}14\) bits per edge