An experimental comparison of four graph drawing algorithms.

DOI10.1016/S0925-7721(96)00005-3zbMath1133.68460MaRDI QIDQ2482890

Roberto Tamassia, Ashim Garg, Giuseppe Di Battista, Emanuele Tassinari, Giuseppe Liotta, Francesco Vargiu

Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

graph drawingalgorithms implementationorthogonal drawingsexperimental comparison of algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (38)

Algorithms for the fixed linear crossing number problem ⋮ Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics ⋮ Drawing database schemas ⋮ Relating bends and size in orthogonal graph drawings ⋮ Star-struck by fixed embeddings: modern crossing number heuristics ⋮ A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT ⋮ Graph Compact Orthogonal Layout Algorithm ⋮ Computing orthogonal drawings with the minimum number of bends ⋮ New results on drawing angle graphs ⋮ A better heuristic for orthogonal graph drawings ⋮ Orthogonal drawing of high degree graphs with small area and few bends ⋮ The Open Graph Archive: A Community-Driven Effort ⋮ Strong SDP based bounds on the cutwidth of a graph ⋮ A Note on the Practicality of Maximal Planar Subgraph Algorithms ⋮ Algorithms for the multiple label placement problem ⋮ Unnamed Item ⋮ DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ An Interactive Tool to Explore and Improve the Ply Number of Drawings ⋮ Experimental Analysis of the Accessibility of Drawings with Few Segments ⋮ A New Approach to Exact Crossing Minimization ⋮ A framework and algorithms for circular drawings of graphs ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Unnamed Item ⋮ A branch-and-cut approach to the crossing number problem ⋮ Graph layering by promotion of nodes ⋮ Experimental Analysis of the Accessibility of Drawings with Few Segments ⋮ Computing Maximum C-Planar Subgraphs ⋮ Efficient Extraction of Multiple Kuratowski Subdivisions ⋮ Stronger ILPs for the Graph Genus Problem. ⋮ Non-planar core reduction of graphs ⋮ Advances in the Planarization Method: Effective Multiple Edge Insertions ⋮ Upward Planarity Testing in Practice ⋮ Advances in the theory and practice of graph drawing ⋮ An effective crossing minimisation heuristic based on star insertion ⋮ 1-planarity testing and embedding: an experimental study ⋮ Orthogonal drawings of graphs with vertex and edge labels ⋮ An optimal layout of multigrid networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• Three-dimensional graph drawing
• Drawing plane graphs nicely
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Efficient orthogonal drawings of high degree graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• DAG—a program that draws directed graphs
• Universality considerations in VLSI circuits
• Efficient Planarity Testing
• An Analytical Solution of Vector Diffraction for Focusing Optical Systems
• How to Draw a Graph

This page was built for publication: An experimental comparison of four graph drawing algorithms.