An experimental comparison of four graph drawing algorithms.
From MaRDI portal
Publication:2482890
DOI10.1016/S0925-7721(96)00005-3zbMATH Open1133.68460MaRDI QIDQ2482890FDOQ2482890
Authors: Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu 
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- Efficient Planarity Testing
- 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
- A linear-time algorithm for drawing a planar graph on a grid
- An algorithm for drawing general undirected graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- How to Draw a Graph
- Universality considerations in VLSI circuits
- Three-dimensional graph drawing
- Title not available (Why is that?)
- Efficient orthogonal drawings of high degree graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Drawing plane graphs nicely
- An Analytical Solution of Vector Diffraction for Focusing Optical Systems
- DAG—a program that draws directed graphs
Cited In (43)
- A branch-and-cut approach to the crossing number problem
- A New Approach to Exact Crossing Minimization
- Graph compact orthogonal layout algorithm
- An optimal layout of multigrid networks
- An Experimental Study on Distance-Based Graph Drawing
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
- A note on the practicality of maximal planar subgraph algorithms
- Computing Maximum C-Planar Subgraphs
- Orthogonal drawing of high degree graphs with small area and few bends
- Title not available (Why is that?)
- Computing orthogonal drawings with the minimum number of bends
- Relating bends and size in orthogonal graph drawings
- New results on drawing angle graphs
- A framework and algorithms for circular drawings of graphs
- Experimental analysis of the accessibility of drawings with few segments
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- Orthogonal drawings of graphs with vertex and edge labels
- Experimental analysis of the accessibility of drawings with few segments
- Non-planar core reduction of graphs
- Strong SDP based bounds on the cutwidth of a graph
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Large-Graph Layout Algorithms at Work: An Experimental Study
- Star-struck by fixed embeddings: modern crossing number heuristics
- Maximum upward planar subgraphs of embedded planar digraphs
- Advances in the theory and practice of graph drawing
- Algorithms for the multiple label placement problem
- A better heuristic for orthogonal graph drawings
- Graph layering by promotion of nodes
- Drawing directed acyclic graphs: an experimental study
- The Open Graph Archive: a community-driven effort
- Algorithms for the fixed linear crossing number problem
- Stronger ILPs for the Graph Genus Problem.
- Advances in the planarization method: effective multiple edge insertions
- Upward planarity testing in practice: SAT formulations and comparative study
- An effective crossing minimisation heuristic based on star insertion
- Title not available (Why is that?)
- Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Graph Drawing
- Drawing database schemas
- 1-planarity testing and embedding: an experimental study
- Efficient Extraction of Multiple Kuratowski Subdivisions
This page was built for publication: An experimental comparison of four graph drawing algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482890)
