Ferres, Leo; Fuentes-Sepúlveda, José; Gagie, Travis; He, Meng; Navarro, Gonzalo
(2019)
There are many representations of planar graphs, but few are as elegant as Turán’s (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multi-edges, and can store any specified embedding. ...