Let G be a bipartite graph, and let λ1,λ2 be two parallel convex curves; we study the question about whether G admits a planar straight line drawing such that the vertices of one partite set of G lie on λ1 and the vertices of the other partite set lie on λ2 . A characterization is presented that gives rise to linear time testing and drawing algorithms.
Drawing Bipartite Graphs on Two Curves
DI GIACOMO, Emilio;GRILLI, LUCA;LIOTTA, Giuseppe
2007
Abstract
Let G be a bipartite graph, and let λ1,λ2 be two parallel convex curves; we study the question about whether G admits a planar straight line drawing such that the vertices of one partite set of G lie on λ1 and the vertices of the other partite set lie on λ2 . A characterization is presented that gives rise to linear time testing and drawing algorithms.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.
