Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Background: Paenibacillus larvae is the agent of the American Foulbrood disease (AFB), which may determine the death of the hive… 
Highly Cited
2010
Highly Cited
2009
Highly Cited
2009
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which… 
2009
2009
Given a graph G=(V,E) with node weight w:V→R+ and a subset S⊆V, find a minimum total weight tree interconnecting all nodes in S… 
2008
2008
Many protocols in ad-hoc networks use dominating and connected dominating sets, for example for broadcasting and routing. For… 
2007
2007
We give a distributed approximation algorithm for the vertexpacking problemin unit-disk graphs. Given a graph H, the algorithm… 
2006
2006
We give an algorithm for constructing a connected spanning subgraphs(panner) of a wireless network modelled as a unit disk graph… 
Review
2004
Review
2004
We consider graph models which represent communication in wireless ad-hoc networks. In such networks, each node equipped with a…