scientific article; zbMATH DE number 6783486
From MaRDI portal
Publication:5365133
zbMath1374.68352MaRDI QIDQ5365133
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133151
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On the plane angle-monotone graphs ⋮ Angle-monotonicity of Delaunay triangulation ⋮ Succinct greedy drawings do not always exist ⋮ (Weakly) self-approaching geometric graphs and spanners ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ Succinct strictly convex greedy drawing of 3-connected plane graphs ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ Greedy rectilinear drawings ⋮ Every Schnyder drawing is a greedy embedding ⋮ Unnamed Item
This page was built for publication: