Unit disk graph

Known as: UDG 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
0204019902017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Let $$S \subset \mathbb {R}^2$$ S⊂R2 be a set of n sites. The unit disk graph $${{\mathrm{UD}}}(S)$$ UD(S) on S has vertex set S… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
Motivated by a satellite communications problem, we consider a generalised colouring<lb>problem on unit disk graphs. A colouring… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2007
2007
We present the first location-oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of… (More)
  • table 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we study a model for ad-hoc networks close enough to reality as to represent existing networks, being at the same… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Unit disk graphs are the intersection graphs of unit diameter closed disks in the plane. This paper reduces SATISFIABILITY to the… (More)
  • figure 13
Is this relevant?
1997
1997
We characterize the complexity of a number of basic optimization problems for unit disk graphs speciied hierarchically as in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics… (More)
Is this relevant?