scientific article; zbMATH DE number 1858605
From MaRDI portal
Publication:4789076
DOI<1235::AID-SPE339>3.0.CO;2-B 10.1002/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-BzbMath1147.68785MaRDI QIDQ4789076
Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu, Luca Vismara
Publication date: 23 January 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Algorithms for plane representations of acyclic digraphs
- Constrained visibility representations of graphs
- Area requirement and symmetry display of planar upward drawings
- Edge crossings in drawings of bipartite graphs
- Algorithms for drawing graphs: An annotated bibliography
- Algorithms for area-efficient orthogonal drawing
- A better heuristic for orthogonal graph drawings
- An algorithm for drawing general undirected graphs
- Upward planarity testing
- An experimental comparison of four graph drawing algorithms.
- Crossing Number is NP-Complete
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- DAG—a program that draws directed graphs
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Experiments on drawing 2-level hierarchical graphs
