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)

Related topics

Related topics

18 relations
Approximation algorithmBarrier resilienceClique problemComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Message Dissemination Using Lévy Flight on Unit Disk Graphs
Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including… 
2010
2010
3d Local Algorithm for Dominating Sets of Unit Disk Graphs
A dominating set of a graph G = (V,E) is a subset V 0 2 V of the nodes such that for all nodes v 2 V , either v 2 V 0 or a… 
2008
2008
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
Many protocols in ad-hoc networks use dominating and connected dominating sets, for example for broadcasting and routing. For… 
2008
2008
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph… 
2008
2008
( 6 + ε )-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant… 
2006
2006
Detecting wormhole attacks in wireless networks
We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses… 
2005
2005
Geographical cluster based multihop ad hoc network routing with guaranteed delivery
  • Hannes Frey
  • IEEE International Conference on Mobile Adhoc and…
  • 2005
  • Corpus ID: 9455071
Exploring the faces of a planar graph is a prominent approach to recover from routing failures which may occur during geographic… 
Review
2004
Review
2004
Wireless communication graphs
We consider graph models which represent communication in wireless ad-hoc networks. In such networks, each node equipped with a… 
2003
2003
On the Approximation of Unit Disk Graph Coordinates
In this paper we study a problem occuring in the context of geometric routing algorithms for mobile ad-hoc networks: Finding unit… 
2002
2002
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)