Live briefing
Everything about Unit disk graph
Intersection graph of unit disks in the plane
In geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex for each disk in the family, and with an edge between two vertices whenever the corresponding vertices lie within a unit distance of each other. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Unit disk graphA 5-minute orientation
- Skim a recent paper: Vertex-edge domination in unit disk graphsInfluential work since 2022
- Pick up a classic book: Eloquent JavascriptThe most-reprinted book on the subject
- Read the landmark paper: Unit disk graphsCited 1,085 times
- Go sideways: Hyperbolic geometric graphA closely related topic
- Go sideways: Indifference graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Unit disk graphs
Simple heuristics for unit disk graphs
Unit disk graph recognition is NP-hard
Ad hoc networks beyond unit disk graphs
On Coloring Unit Disk Graphs
A better constant-factor approximation for weighted dominating set in unit disk graph
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
Approximation algorithms for maximum independent set of a unit disk graph
🆕 Influential since 2022
Vertex-edge domination in unit disk graphs
Algorithmic aspects of secure domination in unit disk graphs
Total (restrained) domination in unit disk graphs
Parameterized Study of Steiner Tree on Unit Disk Graphs
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
📚 Books worth reading
Eloquent JavascriptMarijn Haverbeke · 2009
Approximation and Online AlgorithmsThomas Erlebach · 2013
SimCity 2000Nick Dargahi, Michael Bremer · 1994
Approximation and online algorithmsWAOA 2009 (2009 Copenhagen, Denmark) · 2010
Introduction to making very big booksUnited States. Congress. Senate. Committee on Pensions · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hyperbolic geometric graph A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are…
- Indifference graph In graph theory, a branch of mathematics, an indifference graph is an undirected graph constructed by assigning a real number to each vertex and connecting…
- Circle packing theorem The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible patterns of tangent circles among non-overlapping…
- Penny graph In geometric graph theory, a penny graph is a contact graph of unit circles. It is formed from a collection of unit circles that do not cross each other…
- Greedy embedding In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications network…
- Unit distance graph In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting…
- Greedy coloring In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of…
- Planar separator theorem In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split into…