Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

DOI10.1137/S0895480197325031zbMath0937.05073MaRDI QIDQ4699160

Hsueh-I Lu, Xin He, Ming-Yang Kao

Publication date: 23 November 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

data compressionplanar graphstriangulationsgraph encodingtriconnected graphscanonical ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Visibility representations of four-connected plane graphs with near optimal heights ⋮ Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ A compact encoding of plane triangulations with efficient query supports ⋮ An edgebreaker-based efficient compression scheme for regular meshes ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ A Compact Encoding of Plane Triangulations with Efficient Query Supports

This page was built for publication: Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings