Graph Drawing

DOI10.1007/b94919zbMath1215.05113OpenAlexW4250021921MaRDI QIDQ5896917

David Eppstein, Stephen G. Kobourov, Petra Mutzel, Giuseppe Liotta, Franz-Josef Brandenburg, Michael T. Goodrich

Publication date: 11 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94919

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (16)

The Complexity of Drawing a Graph in a Polygonal Region ⋮ Drawing Planar Graphs on Area ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ The complexity of drawing a graph in a polygonal region ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Counting the number of crossings in geometric graphs ⋮ Thickness and colorability of geometric graphs ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) ⋮ Four-Connected Spanning Subgraphs of Doughnut Graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Accelerated Bend Minimization ⋮ Small area drawings of outerplanar graphs ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

This page was built for publication: Graph Drawing