Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits

DOI10.1137/120879142zbMath1092.68612arXiv1401.2538MaRDI QIDQ4828935

Hsueh-I Lu

Publication date: 29 November 2004

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2538

zbMATH Keywords

planar graphs; compression; data structures; graph algorithms

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures

Uses Software

• Edgebreaker