## Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge
Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco
(2008)
Full text not available from this repository. ## AbstractHamiltonicity, book embeddability, and point-set embeddability of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to design polynomial-time algorithms to embed $k$-colored planar graphs on these sets such that the resulting drawings have $O(k)$ bends per edge.
Repository Staff Only: item control page References |