Short encodings of planar graphs and maps

Kenneth Keeler, Jeffery Westbrook
1995 Discrete Applied Mathematics  
We discuss space-efficient encoding schemes for planar graphs and maps. Our results improve on the constants of previous schemes and can be achieved with simple encoding algorithms. They are near-optimal in number of bits per edge. . 3This is not actually stated in [9]; the storage requirement is given as < 12 bits per vertex. 0166-218X/95/$09.50 0 1995-Elsevier Science B.V. All rights reserved SSDI 0166-218X(93)E0150-W
doi:10.1016/0166-218x(93)e0150-w fatcat:ergpesoz3zcfhcdrshey2z7kui