An experimental comparison of four graph drawing algorithms.
From MaRDI portal
Publication:2482890
Recommendations
Cites work
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- scientific article; zbMATH DE number 53077 (Why is no real title available?)
- scientific article; zbMATH DE number 177556 (Why is no real title available?)
- A linear-time algorithm for drawing a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Algorithms for drawing graphs: An annotated bibliography
- An Analytical Solution of Vector Diffraction for Focusing Optical Systems
- An algorithm for drawing general undirected graphs
- DAG—a program that draws directed graphs
- Drawing plane graphs nicely
- Efficient Planarity Testing
- Efficient orthogonal drawings of high degree graphs
- How to Draw a Graph
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Three-dimensional graph drawing
- Universality considerations in VLSI circuits
Cited in
(43)- A branch-and-cut approach to the crossing number problem
- An optimal layout of multigrid networks
- A New Approach to Exact Crossing Minimization
- Graph compact orthogonal layout algorithm
- 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
- Relating bends and size in orthogonal graph drawings
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- New results on drawing angle graphs
- Computing orthogonal drawings with the minimum number of bends
- A framework and algorithms for circular drawings of graphs
- Experimental analysis of the accessibility of drawings with few segments
- Orthogonal drawings of graphs with vertex and edge labels
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- Non-planar core reduction of graphs
- Experimental analysis of the accessibility of drawings with few segments
- Strong SDP based bounds on the cutwidth of a graph
- Maximum upward planar subgraphs of embedded planar digraphs
- Star-struck by fixed embeddings: modern crossing number heuristics
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Large-Graph Layout Algorithms at Work: An Experimental Study
- Advances in the theory and practice of graph drawing
- A better heuristic for orthogonal graph drawings
- Algorithms for the multiple label placement problem
- Graph layering by promotion of nodes
- Drawing directed acyclic graphs: an experimental study
- Algorithms for the fixed linear crossing number problem
- The Open Graph Archive: a community-driven effort
- 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
- scientific article; zbMATH DE number 2079638 (Why is no real title available?)
- 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)
