Drawing directed acyclic graphs: an experimental study

DOI10.1142/S0218195900000358zbMATH Open0970.68181MaRDI QIDQ2708043FDOQ2708043

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)

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

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)

Cites Work

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

Cited In (15)

• Clustering a DAG for CAD databases
• An Experimental Study on Distance-Based Graph Drawing
• Title not available (Why is that?)
• L-Drawings of Directed Graphs
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
• A Note on the Practicality of Maximal Planar Subgraph Algorithms
• Star-struck by fixed embeddings: modern crossing number heuristics
• Dagview: an approach for visualizing large graphs
• The Open Graph Archive: a community-driven effort
• Upward planarity testing in practice: SAT formulations and comparative study
• Using a Significant Spanning Tree to Draw a Directed Graph
• A Generalization of the Directed Graph Layering Problem
• An experimental comparison of four graph drawing algorithms.
• DAG—a program that draws directed graphs
• A natural quadratic approach to the generalized graph layering problem

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)