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

DOI10.1007/978-3-540-77537-9_31zbMath1137.68478OpenAlexW1551357953WikidataQ62042558 ScholiaQ62042558MaRDI QIDQ5452234

Francesco Trotta, Giuseppe Liotta, Emilio Di Giacomo

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_31

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Constrained Point-Set Embeddability of Planar Graphs

This page was built for publication: Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge