Results 11 to 20 of about 142,780 (319)
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
Strongly Hyperbolic Unit Disk Graphs
Symposium on Theoretical Aspects of Computer Science, 2021 The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and introduce ...
Thomas Bläsius +3 more
semanticscholar +9 more sources
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
Computing Maximum Cliques in Unit Disk Graphs [PDF]
Canadian Conference on Computational GeometryGiven a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$.
A. Tkachenko, Haitao Wang
openalex +2 more sources
Reverse Shortest Path Problem for Unit-Disk Graphs [PDF]
Workshop on Algorithms and Data Structures, 2021 Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at most r (the ...
Haitao Wang, Yiming Zhao
semanticscholar +5 more sources
Parameterized Study of Steiner Tree on Unit Disk Graphs [PDF]
Algorithmica, 2020 We study the Steiner Tree problem on unit disk graphs. Given a n vertex unit disk graph G , a subset $$R\subseteq V(G)$$ R ⊆ V ( G ) of t vertices and a positive integer k , the objective is to decide if there exists a tree T in G that spans over all ...
Sujoy Bhore +3 more
openalex +2 more sources
Subcoloring of (Unit) Disk Graphs
International Symposium on Mathematical Foundations of Computer ScienceA subcoloring of a graph is a partition of its vertex set into subsets (called colors), each inducing a disjoint union of cliques. It is a natural generalization of the classical proper coloring, in which each color must instead induce an independent set.
Malory Marin, R´emi Watrigant
semanticscholar +4 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
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs [PDF]
International Symposium on Computational GeometryIn this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $k$ vertex-disjoint cycles of G if it exists. Our algorithm runs in time
Shinwoo An, Eun‐Jin Oh
openalex +2 more sources