Results 11 to 20 of about 124,717 (298)
Sparse hop spanners for unit disk graphs [PDF]
Computational Geometry, 2021 20 pages, 9 ...
Adrian Dumitrescu +2 more
openalex +6 more sources
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
Compact 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
Wolfgang Mulzer, Max Willert
+6 more sources
Colouring stability two unit disk graphs
, 2011 We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
Henning Bruhn
openalex +3 more sources
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
Minimum bisection is NP-hard on unit disk graphs [PDF]
Information and Computation, 2017 17 pages, 6 ...
Josep Dı́az, George B. Mertzios
openalex +9 more sources
Dynamic Parameterized Problems on Unit Disk Graphs [PDF]
To appear in ISAAC ...
Shinwoo An +8 more
openalex +5 more sources
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
Minimum Clique Partition in Unit Disk Graphs [PDF]
Graphs and Combinatorics, 2011 Comment: 12 pages, 3 ...
Adrian Dumitrescu, János Pach
openalex +5 more sources