Results 61 to 70 of about 124,454 (161)
On Embeddability of Unit Disk Graphs onto Straight Lines [PDF]
Theory of Computing Systems, 2020 Comment: 20 pages, accepted to CSR ...
openaire +2 more sources
Physical Review ResearchWe propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to efficiently map generic
Martin J. A. Schuetz +9 more
doaj +1 more source
Near Optimal Broadcast with Network Coding in Large Sensor Networks [PDF]
, 2007 We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (
Adjih, Cédric +2 more
core +2 more sources
Hamiltonian cycles in faulty random geometric networks [PDF]
, 2001 In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks.
Petit Silvestre, Jordi
core +1 more source
Subcoloring of (Unit) Disk Graphs
Extended abstract in MFCS ...
Marin, Malory, Watrigant, Rémi
openaire +3 more sources
Shortest paths in intersection graphs of unit disks
Computational Geometry, 2015 An alternative approach for the unweighted case is added to the ...
Cabello, Sergio, Jejčič, Miha
openaire +2 more sources
enCompact Routing in Unit Disk Graphs
, 2020 Let V ⊂ ℝ² be a set of n sites in the plane. The unit disk graph DG(V) of V is the graph with vertex set V where two sites v and w are adjacent if and only if their Euclidean distance is at most 1. We develop a compact routing scheme ℛ for DG(V). The routing scheme ℛ preprocesses DG(V) by assigning a label 𝓁(v) to every site v in V. After that, for any
Mulzer, Wolfgang, Willert, Max
openaire +1 more source
Greedy routing with guaranteed delivery using Ricci flows [PDF]
, 2009 Greedy forwarding with geographical locations in a wireless sensor network may fail at a local minimum. In this paper we propose to use conformal mapping to compute a new embedding of the sensor nodes in the plane such that greedy forwarding with the ...
Gao, Jie +4 more
core +3 more sources
Dynamic parameterized problems on unit disk graphs
To appear in ISAAC ...
An, Shinwoo +8 more
openaire +4 more sources
Maxclique and unit disk characterizations of strongly chordal graphs
Discussiones Mathematicae Graph Theory, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De Caria, Pablo Jesús, McKee, Terry A.
openaire +4 more sources