Live briefing
Everything about Graph drawing
Visualization of node-link graphs
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph drawingA 5-minute orientation
- Skim a recent paper: Graph Neural Networks for Graph DrawingInfluential work since 2022
- Pick up a classic book: DesignThe most-reprinted book on the subject
- Read the landmark paper: Graph drawing by force‐directed placementCited 4,526 times
- Go sideways: SPQR treeA closely related topic
- Go sideways: Layered graph drawingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Graph drawing by force‐directed placement
An algorithm for drawing general undirected graphs
Automatic graph drawing and readability of diagrams
Metrics for Graph Drawing Aesthetics
Online Dynamic Graph Drawing
Graph Drawing by Stochastic Gradient Descent
Graph Drawing by the Magnetic Spring Model
A Survey on Graph Drawing Beyond Planarity
🆕 Influential since 2022
Graph Neural Networks for Graph Drawing
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)^2
Event‐based Dynamic Graph Drawing without the Agonizing Pain
SmartGD: A GAN-Based Graph Drawing Framework for Diverse Aesthetic Goals
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm
📚 Books worth reading
DesignOpen University · 1995
Graph partitioning and graph clusteringGa.) DIMACS Implementation Challenge Workshop (10th 2012 Atlanta · 2013
Total colourings of graphsH. P. Yap · 1996- 📕Deng zhou wen tiZongxi Cai · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- SPQR tree In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex…
- Layered graph drawing Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rows or…
- Hasse diagram In order theory, a Hasse diagram (/ˈhæsə/; German: [ˈhasə]) is a type of mathematical diagram used to represent a finite partially ordered set, in the…
- Bend minimization In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the…
- Upward planar drawing In graph drawing, an upward planar drawing of a directed acyclic graph is an embedding of the graph into the Euclidean plane, in which the edges are represented…
- Planarization In the mathematical field of graph theory, planarization is a method of extending graph drawing methods from planar graphs to graphs that are not planar…
- Program structure tree A program structure tree (PST) is a hierarchical diagram that displays the nesting relationship of single-entry single-exit (SESE) fragments/regions, showing…
- Force-directed graph drawing Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the…