UDG

(redirected from Unit disk graph)
Also found in: Wikipedia.
AcronymDefinition
UDGUniversitat de Girona (Spain)
UDGUniversidad de Guadalajara (México)
UDGUniversidad de Granada (Spanish: University of Granada)
UDGUltimate DJ Gear (Netherlands)
UDGUniversal Distribution Group
UDGUser Defined Graphics
UDGUser Defined Group
UDGUser Defined Gateway
UDGUnit Disk Graph (wireless communication)
UDGUracil DNA Glycosylases
UDGUniversal Distribution Group (Microsoft Exchange Server)
UDGUnited Desert Gateway (El Centro, CA)
UDGUser Defined Graphic
UDGUsability Design Group
UDGUniversal Display Group
UDGUniversal Database Grid (IBM)
UDGUser-Defined Gradient Index
References in periodicals archive ?
A unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane.
Therefore, this definition differs from unit disk graphs, as well as from other intersection models.
An ad hoc network is often approximated as a unit disk graph [10].
Unfortunately, the problem of determining the MCDS in an undirected graph, like that of the unit disk graph considered for modeling MANETs, is NP-complete.
In unit disk graphs such as the static graphs used in our research, Step 5 of the algorithm (pseudo code in Figure 12) is not needed and the minimal spanning tree [T.
A graph is a unit disk graph (UDG) if its vertices can be drown as circular disks of equal radius in the plane in such a way that there is an edge between two vertices if and only if the two disks have non-empty intersection.
The neighborhood of a vertex in unit disk graph, contains at most five independent vertices.
Assume v is a vertex of unit disk graph G which has six independent vertices.
Thus it can be modeled as a unit disk graph [11], a geometric graph in which there is an edge between two nodes if and only if their distance is at most one.
In general graph case, and even in unit disk graph, the problem to find a DS/CDS/WCDS with minimum cardinality is NP-hard [11,12].
We have analyzed the three algorithms of [10] in unit disk graph.
Corollary 5 The algorithm Solve-GLTC solves the [tau]-bounded generalized list T-coloring problem on a unit disk graph with n vertices in time