Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings

Nina Hammer, Frank Kammer, Johannes Meintrup

We present a novel space-efficient graph coarsening technique for $n$-vertex planar graphs $G$, called cloud partition, which partitions the vertices $V(G)$ into disjoint sets $C$…