scientific article; zbMATH DE number 512936
From MaRDI portal
Publication:4281651
zbMath0925.05056MaRDI QIDQ4281651
Publication date: 9 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
Minimum-segment convex drawings of 3-connected cubic plane graphs ⋮ Drawings of planar graphs with few slopes and segments ⋮ New results on drawing angle graphs ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Universal slope sets for 1-bend planar drawings ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ Optimal polygonal representation of planar graphs ⋮ Drawing partial 2-trees with few slopes ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ The complexity of dominating set in geometric intersection graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Tree Drawings on the Hexagonal Grid ⋮ Rikudo is NP-complete
This page was built for publication:
