We digress about the strict interplay between the graph-theoretic problem of computing a Hamiltonian augmentation of a planar graph G and the graph drawing problem of embedding G onto a given set of points. We review different Hamiltonian augmentation techniques and their impact on different variants of the corresponding graph drawing problem. We also look at universal point sets, simultaneous graph embeddings, and radial graph drawings.
The Hamiltonian Augmentation Problem and its Applications to Graph Drawing
DI GIACOMO, Emilio;LIOTTA, Giuseppe
2010
Abstract
We digress about the strict interplay between the graph-theoretic problem of computing a Hamiltonian augmentation of a planar graph G and the graph drawing problem of embedding G onto a given set of points. We review different Hamiltonian augmentation techniques and their impact on different variants of the corresponding graph drawing problem. We also look at universal point sets, simultaneous graph embeddings, and radial graph drawings.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
