Quick encoding of plane graphs in log214 bits per edge

In this paper, a simple technique to encode any unlabeled and connected plane graph of E edges in Elog214 bits is proposed. Both loops and multiple edges are allowed. The encoding process follows a labeling strategy based on a deterministic traversal of the graph. It improves existing methods which achieve shorter bit-length encodings in both time efficiency and simplicity. Besides, it does not impose any restriction on the number of loops and multiple edges that are allowed. Compared to techniques of similar time requirements, it offers a more compact compression solution.