Results 21 to 30 of about 142,780 (319)
Unit Disk Visibility Graphs [PDF]
, 2021 We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. That is, two entities are not mutually visible if they are too far apart, regardless of having an obstacle between them.
��a����r��c��, Onur +1 more
openaire +3 more sources
Distributed coloring and the local structure of unit-disk graphs [PDF]
Algorithmic Aspects of Wireless Sensor Networks, 2022 Louis Esperet +2 more
openalex +3 more sources
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete [PDF]
arXiv.org, 2023 A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial inequalities. In
Nicholas Bieker +3 more
semanticscholar +1 more source
Liar's domination in unit disk graphs [PDF]
Theoretical Computer Science, 2020 In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in unit disk graphs. Next, we show that the recent sub-quadratic time $\frac{11}{2}$-factor approximation algorithm \cite{bhore} for the MLDS problem is erroneous and propose a ...
Ramesh K. Jallu +2 more
openaire +3 more sources
Routing in Unit Disk Graphs [PDF]
Algorithmica, 2016 Let $S \subset \mathbb{R}^2$ be a set of $n$ sites. The unit disk graph $\text{UD}(S)$ on $S$ has vertex set $S$ and an edge between two distinct sites $s,t \in S$ if and only if $s$ and $t$ have Euclidean distance $|st| \leq 1$. A routing scheme $R$ for $\text{UD}(S)$ assigns to each site $s \in S$ a label $\ell(s)$ and a routing table $ (s)$.
Haim Kaplan +3 more
openaire +3 more sources
Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays
PRX Quantum, 2023 Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits.
Minh-Thi Nguyen +5 more
doaj +1 more source
Case Studies in Thermal Engineering, 2022 This research article concentrates on forced convection with a high Reynolds number of the water-alumina-based nanofluid in the square cavity containing a rotating disk with a unit speed. A very dense mesh is used to obtain the numerical results with the
Usman +6 more
doaj +1 more source
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs [PDF]
arXiv.org, 2022 We consider the problem of computing routing schemes in the $\mathsf{HYBRID}$ model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables
Samantha R. Coy +4 more
semanticscholar +1 more source
Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs [PDF]
arXiv.org, 2022 Unit disk graphs are the set of graphs which represent the intersection of disk graphs and interval graphs. These graphs are of great importance due to their structural similarity with wireless communication networks.
D. Chatterjee, Rishiraj Bhattacharyya
semanticscholar +1 more source
Location Oblivious Distributed Unit Disk Graph Coloring [PDF]
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbeau, Michel +4 more
openaire +1 more source