Graph Drawing

Graph Drawing
Name	Graph Drawing
Field	Discrete mathematics, Theoretical computer science, Information visualization
Related	Graph theory, Computational geometry, Network science

Graph Drawing

Graph Drawing studies the visual representation of mathematical Graph theory structures and their embeddings in the plane and higher-dimensional spaces, linking work in Paul Erdős-era combinatorics, Kurt Gödel-influenced topology, and applied research from institutions like AT&T Bell Laboratories and Bell Labs. It unites classical results from scholars such as William Tutte, Gustav Kirchhoff, and Frank Harary with algorithmic advances tied to researchers affiliated with Stanford University, Massachusetts Institute of Technology, and University of Cambridge.

History

Early roots trace to practical drawings by Leonardo da Vinci and schematic diagrams used in projects like the Eddystone Lighthouse planning and maps by Gerardus Mercator, but formalization emerged from work by Arthur Cayley and James Joseph Sylvester on networks, continuing through proofs by Kuratowski and constructive methods by Tutte. The mid-20th century saw influential contributions from Doron Zeilberger, John Hopcroft, and Robert Tarjan in algorithmic graph theory, while later periods feature conferences such as Symposium on Graph Drawing and journals hosted by ACM and IEEE. Institutional centers including University of Toronto, ETH Zurich, and Tokyo Institute of Technology became hubs for research alongside industry labs like Xerox PARC and Google Research.

Foundations and Definitions

Foundational concepts derive from Graph theory and Topology with formal definitions of vertices and edges, planar embeddings characterized by results of Kazimierz Kuratowski and William Tutte, and matrix representations popularized by Arthur Cayley and Gustav Kirchhoff. Rigorous complexity classifications reference seminal work by Cook and Richard Karp on NP-completeness and reductions relevant to layout optimization problems studied by researchers from Carnegie Mellon University and Princeton University. Fundamental theorems from Euler and structural paradigms influenced by Paul Erdős and András Hajnal underpin combinatorial constraints, while metric and spectral approaches trace to Issai Schur and Hermann Weyl.

Layout Methods and Algorithms

Force-directed algorithms build on physical analogies promoted by Tutte and implemented in projects at Bell Labs and Silicon Graphics, while spectral layouts follow linear-algebra techniques associated with John von Neumann and Stewart Wilcox-style matrix analysis used in work at Bell Labs and IBM Research. Planarization methods and orthogonal drawings owe to contributions from Klaus Wagner and complexity results from Michael Garey and David Johnson. Hierarchical layouts reflect concerns addressed by Kenneth E. Iverson and practitioners at Hewlett-Packard, and multilevel and multiscale schemes evolved through collaborations including Paul H. C. Eilers and teams at Sandia National Laboratories. Algorithms for crossing minimization cite studies by Reinhard Diestel and Cristopher Moore with practical implementations in systems developed at Microsoft Research and Nokia Research Center.

Aesthetic Criteria and Evaluation

Aesthetic criteria derive from perceptual studies linked to work by Donald Norman and cognitive experiments influenced by Anne Treisman and Rachel K. E. Shepard. Metrics include minimizing edge crossings studied at Georgia Institute of Technology, maintaining uniform edge lengths connected to research at University of Illinois Urbana-Champaign, and preserving mental map continuity explored at University of California, Berkeley by groups associated with Stuart Card and Ben Shneiderman. Empirical evaluation employs user studies following protocols from CHI conferences and statistical methods promoted by Ronald Fisher and Jerome H. Friedman.

Applications and Domains

Applications span biological networks modeled by teams at European Molecular Biology Laboratory and Cold Spring Harbor Laboratory, software engineering dependency graphs used in tools from Sun Microsystems and JetBrains, social network visualizations studied by researchers at Harvard University and MIT Media Lab, and infrastructure mapping in projects tied to US Department of Transportation and European Space Agency. Other domains include circuit layout and VLSI design developed by Intel and TSMC, knowledge graphs used by Wolfram Research and SRI International, and humanities projects curated by Library of Congress and British Library.

Software and Implementations

Prominent implementations include systems such as Graphviz developed with roots in AT&T Bell Laboratories, commercial platforms like yWorks and Cytoscape originating from academic collaborations at University of California, San Diego, and integrated visualization libraries produced by D3.js teams and Mozilla Foundation-adjacent projects. Research codebases appear from groups at University of Konstanz, Institute Henri Poincaré, and Max Planck Institute while enterprise solutions are provided by Palantir Technologies and SAP SE. Open-source ecosystems and standards gain contributions from communities around GNU Project and Apache Software Foundation.

Category:Graph theory