Results 61 to 70 of about 89,804 (156)
, 2011 We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
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
On the Complexity of Scheduling in Wireless Networks
EURASIP Journal on Wireless Communications and Networking, 2010 We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of -hop interference models, under which no two links within a -hop distance can successfully ...
Sharma Gaurav +3 more
doaj
Dynamic parameterized problems on unit disk graphs
To appear in ISAAC ...
An, Shinwoo +8 more
openaire +4 more sources
Spanners for Geometric Intersection Graphs
, 2006 Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair
Furer, Martin +1 more
core +2 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.
openaire +2 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
Mulzer, Wolfgang, Willert, Max
openaire +2 more sources
Improper colouring of unit disk graphs
, 2007 Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is k -improper if no vertex receives the same colour as k +1 of its neighbours. The k -improper chromatic number chi_k (G) is the least number of colours needed in a k -improper colouring of a graph G.
Havet, Frédéric +2 more
openaire +1 more source