Results 201 to 210 of about 83,874 (238)

Restart uncertainty relation for monitored quantum dynamics. [PDF]

Proc Natl Acad Sci U S A
Yin R, Wang Q, Tornow S, Barkai E.
europepmc   +1 more source

Dissociable control of motivation and reinforcement by distinct ventral striatal dopamine receptors. [PDF]

Nat Neurosci
Enriquez-Traba J, Arenivar M, Yarur-Castillo HE, Noh C, Flores RJ, Weil T, Roy S, Usdin TB, LaGamma CT, Wang H, Tsai VS, Kerspern D, Moritz AE, Sibley DR, Lutas A, Moratalla R, Freyberg Z, Tejeda HA.   +17 more
europepmc   +1 more source

GW: ultra-fast chromosome-scale visualisation of genomics data

Cleal K, Kearsey A, Baird DM.
europepmc   +1 more source

Unit disk graph approximation [PDF]

Proceedings of the 2004 joint workshop on Foundations of mobile computing, 2004
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a variety of fields. In wireless ad hoc and sensor networks, such an embedding can be used to obtain virtual coordinates. In this paper, we prove a non-approximability result for the problem of embedding a given unit disk graph ...
Fabian Kuhn, Roger Wattenhofer, Thomas Moscibroda   +2 more
openaire   +1 more source

Planar Hop Spanners for Unit Disk Graphs [PDF]

, 2010
The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc ...
Catusse, Nicolas, Chepoi, Victor, Vaxès, Yann   +2 more
openaire   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

On Coloring Unit Disk Graphs

Algorithmica, 1998
In this paper the coloring problem for unit disk (UD) graphs is considered. UD graphs are the intersection graphs of equal-sized disks in the plane. Colorings of UD graphs arise in the study of channel assignment problems in broadcast networks. Improving on a result of Clark et al.
Albert Gräf, Gerhard Weißenfels, M. Stumpf   +2 more
openaire   +2 more sources

Vertex-Edge Domination in Unit Disk Graphs

Discrete Applied Mathematics, 2020
Abstract Let G = ( V , E ) be a simple undirected graph. A set D ⊆ V is called a vertex-edge dominating set of G if for each edge e = u v ∈ E , either u or v is in D or one vertex from their neighbor is in D . Simply, a vertex v ∈ V , vertex-edge dominates every edge u v
Sangram K. Jena, Gautam K. Das
openaire   +3 more sources