DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY

DOI10.1142/S0218195900000358zbMath0970.68181MaRDI QIDQ2708043

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

Publication date: 17 April 2001

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

zbMATH Keywords

graph drawingdirected acyclic graphsdrawing algorithms

Mathematics Subject Classification ID

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

Related Items

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics, Star-struck by fixed embeddings: modern crossing number heuristics, The Open Graph Archive: A Community-Driven Effort, A Generalization of the Directed Graph Layering Problem, A Note on the Practicality of Maximal Planar Subgraph Algorithms, A natural quadratic approach to the generalized graph layering problem, Upward Planarity Testing in Practice

Cites Work

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