Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Richie Chih-Nan Chuang, Ashim Garg, Xin He +2

Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G…