Skip to main content
Conference ProceedingsOPEN ACCESS

Drawing colored graphs with constrained vertex positions and few bends per edge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4875 LNCS 315-326
DOI: 10.1007/978-3-540-77537-9_31
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hamiltonicity, book embeddability, and point-set embedda- bility 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 bends per edge. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Di Giacomo, E., Liotta, G., & Trotta, F. (2008). Drawing colored graphs with constrained vertex positions and few bends per edge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 315–326). https://doi.org/10.1007/978-3-540-77537-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free