Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge

Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2008) Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 315-326(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_31).

Full text not available from this repository.

Abstract

Hamiltonicity, 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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-77537-9_31
Classifications: P Styles > P.999 Others
G Algorithms and Complexity > G.210 Bends
URI: http://gdea.informatik.uni-koeln.de/id/eprint/848

Actions (login required)

View Item View Item