Drawing directed acyclic graphs: an experimental study

DOI10.1142/S0218195900000358MaRDI QIDQ2708043zbMATHFDO

Authors Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara

Publication date 17 April 2001

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphsgraph drawingdrawing algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• scientific article; zbMATH DE number 30296
• scientific article; zbMATH DE number 4062623
• An experimental comparison of four graph drawing algorithms.
• scientific article; zbMATH DE number 1858605
• Large-Graph Layout Algorithms at Work: An Experimental Study

Cites work

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A unified approach to visibility representations of planar graphs
• Algorithms for drawing graphs: An annotated bibliography
• An experimental comparison of four graph drawing algorithms.
• Area requirement and symmetry display of planar upward drawings
• Constrained visibility representations of graphs
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Upward planarity testing

Cited in

(15)

• A note on the practicality of maximal planar subgraph algorithms
• L-Drawings of Directed Graphs
• Using a Significant Spanning Tree to Draw a Directed Graph
• A generalization of the directed graph layering problem
• DAG—a program that draws directed graphs
• A natural quadratic approach to the generalized graph layering problem
• Clustering a DAG for CAD databases
• Star-struck by fixed embeddings: modern crossing number heuristics
• scientific article; zbMATH DE number 1974120 (Why is no real title available?)
• An Experimental Study on Distance-Based Graph Drawing
• An experimental comparison of four graph drawing algorithms.
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
• Upward planarity testing in practice: SAT formulations and comparative study
• Dagview: an approach for visualizing large graphs
• The Open Graph Archive: a community-driven effort

This page was built for publication: Drawing directed acyclic graphs: an experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708043)