scientific article; zbMATH DE number 1256645
From MaRDI portal
Publication:4230331
zbMath0918.68075MaRDI QIDQ4230331
Publication date: 22 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10)
Related Items (20)
Optimal orthogonal drawings of triconnected plane graphs ⋮ Greedy drawings of triangulations ⋮ Grid embedding of 4-connected plane graphs ⋮ New results on drawing angle graphs ⋮ Algorithms for area-efficient orthogonal drawing ⋮ Universal slope sets for 1-bend planar drawings ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ How to draw a planar clustered graph ⋮ Output-sensitive reporting of disjoint paths (extended abstract) ⋮ A more compact visibility representation ⋮ On-line convex planarity testing ⋮ Two algorithms for finding rectangular duals of planar graphs ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ Edge-orders ⋮ Drawing planar graphs with circular arcs ⋮ Minimum-width grid drawings of plane graphs ⋮ A Simple Criterion for Nodal 3-connectivity in Planar Graphs ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths ⋮ A force-directed algorithm that preserves edge-crossing properties
This page was built for publication:
