The Turing Test for Graph Drawing Algorithms
From MaRDI portal
Publication:5014138
Cites work
- scientific article; zbMATH DE number 1693471 (Why is no real title available?)
- scientific article; zbMATH DE number 2084303 (Why is no real title available?)
- scientific article; zbMATH DE number 2084318 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- A Fast Multi-Scale Method for Drawing Large Graphs
- A better heuristic for orthogonal graph drawings
- A multi-scale algorithm for drawing graphs nicely
- An algorithm for drawing general undirected graphs
- An experimental evaluation of multilevel layout methods
- COAST: A Convex Optimization Approach to Stress-Based Embedding
- Crossing minimization in linear embeddings of graphs
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Experimental evaluation of book drawing algorithms
- GRIP: Graph Drawing with Intelligent Placement
- Graph-Theoretic Concepts in Computer Science
- Improved Circular Layouts
- Multidimensional scaling. I: Theory and method
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- The three-phase method: a unified approach to orthogonal graph drawing
This page was built for publication: The Turing Test for Graph Drawing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014138)