Quick encoding of plane graphs in _214 bits per edge

DOI10.1016/J.IPL.2008.04.017MaRDI QIDQ975433zbMATH OpenOpenAlexFDO

Authors Raquel Viaña

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

zbMATH Keywords

compressiongraph algorithmsinformation retrievalmapplanar graph

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Short encodings of planar graphs and maps
• Succinct representation of general unlabeled graphs
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• Planar graphs, via well-orderly maps and trees

Cites work

• A Census of Planar Maps
• A Census of Planar Triangulations
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Compressing the Property Mapping of Polygon Meshes
• Dissections and trees, with applications to optimal mesh encoding and to random sampling
• Efficient Coding of Nontriangular Mesh Connectivity
• scientific article; zbMATH DE number 1803830 (Why is no real title available?)
• scientific article; zbMATH DE number 1962839 (Why is no real title available?)
• scientific article; zbMATH DE number 2038776 (Why is no real title available?)
• scientific article; zbMATH DE number 2079399 (Why is no real title available?)
• On the succinct representation of graphs
• Short encodings of planar graphs and maps
• Succinct representation of general unlabeled graphs

Cited in

(3)

• Succinct representation of general unlabeled graphs
• A compact encoding of plane triangulations with efficient query supports
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

Describes a project that uses

Uses Software

• Edgebreaker

This page was built for publication: Quick encoding of plane graphs in \(\log _{2}14\) bits per edge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975433)