Browsing by Subject "Planar embedding"
Now showing items 1-1 of 1
-
(Elsevier, 2020)There are many representations of planar graphs, but few are as elegant as Turan's (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multiedges, and can store any specified embedding. ...