Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,086,800 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Approximation algorithm
Barrier resilience
Clique problem
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Detection of Paenibacillus larvae by Real-Time PCR
S. Chagas
,
R. Vaucher
,
A. Brandelli
Acta Scientiae Veterinariae
2018
Corpus ID: 31809200
Background: Paenibacillus larvae is the agent of the American Foulbrood disease (AFB), which may determine the death of the hive…
Expand
2011
2011
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
J. Czyzowicz
,
S. Dobrev
,
+5 authors
J. Urrutia
Theory and Applications of Models of Computation
2011
Corpus ID: 7374064
We study the problem of computing locally a coloring of an arbitrary planar subgraph of a unit disk graph. Each vertex knows its…
Expand
2010
2010
3d Local Algorithm for Dominating Sets of Unit Disk Graphs
A. Abdallah
,
T. Fevens
,
J. Opatrny
Canadian Conference on Computational Geometry
2010
Corpus ID: 2058382
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…
Expand
Highly Cited
2009
Highly Cited
2009
Unit disk graph and physical interference model: Putting pieces together
E. Lebhar
,
Zvi Lotker
IEEE International Symposium on Parallel…
2009
Corpus ID: 15472530
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which…
Expand
2009
2009
Node-weighted Steiner tree approximation in unit disk graphs
Feng Zou
,
Xianyue Li
,
Suogang Gao
,
Weili Wu
Journal of combinatorial optimization
2009
Corpus ID: 1130188
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…
Expand
2008
2008
Impact of Locality on Location Aware Unit Disk Graphs
Andreas Wiese
,
E. Kranakis
Algorithms
2008
Corpus ID: 12326812
Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local…
Expand
2008
2008
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
J. Czyzowicz
,
S. Dobrev
,
+4 authors
J. Urrutia
Latin American Symposium on Theoretical…
2008
Corpus ID: 912980
Many protocols in ad-hoc networks use dominating and connected dominating sets, for example for broadcasting and routing. For…
Expand
2007
2007
Distributed Approximations for Packing in Unit-Disk Graphs
A. Czygrinow
,
M. Hanćkowiak
International Symposium on Distributed Computing
2007
Corpus ID: 34031389
We give a distributed approximation algorithm for the vertexpacking problemin unit-disk graphs. Given a graph H, the algorithm…
Expand
2006
2006
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
Edgar Chávez
,
S. Dobrev
,
E. Kranakis
,
J. Opatrny
,
L. Stacho
,
J. Urrutia
Latin American Symposium on Theoretical…
2006
Corpus ID: 37341551
We give an algorithm for constructing a connected spanning subgraphs(panner) of a wireless network modelled as a unit disk graph…
Expand
2006
2006
Detecting wormhole attacks in wireless networks
R. Maheshwari
,
Jie Gao
,
S.R. Das
IEEE Workshop on Wireless Mesh Networks
2006
Corpus ID: 17861765
We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses…
Expand
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)
ACCEPT & CONTINUE