scientific article; zbMATH DE number 1256645
From MaRDI portal
Publication:4230331
zbMATH Open0918.68075MaRDI QIDQ4230331FDOQ4230331
Publication date: 22 April 1999
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (23)
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Universal slope sets for 1-bend planar drawings
- A more compact visibility representation
- A force-directed algorithm that preserves edge-crossing properties
- Output-sensitive reporting of disjoint paths (extended abstract)
- Edge-orders
- Planar Lombardi Drawings for Subcubic Graphs
- Grid embedding of 4-connected plane graphs
- Minimum-width grid drawings of plane graphs
- A Simple Criterion for Nodal 3-connectivity in Planar Graphs
- Optimal orthogonal drawings of triconnected plane graphs
- New results on drawing angle graphs
- Greedy drawings of triangulations
- Mondshein sequences (a.k.a. (2,1)-orders)
- A linear-time algorithm for drawing a planar graph on a grid
- Drawing planar graphs with circular arcs
- On-line convex planarity testing
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Algorithms for area-efficient orthogonal drawing
- Drawing planar graphs using the canonical ordering
- How to draw a planar clustered graph
- Structural parameters of Schnyder woods
- Two algorithms for finding rectangular duals of planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230331)
