Results 271 to 280 of about 142,780 (319)

Practical Compact Routing on Random Unit Disk Graphs

ACM transactions on sensor networks
We describe a simple and practical algorithm for compact routing on connected random unit disk graphs. Using a recursive nested dissection of an n-vertex graph based on compact and balanced vertex separators, we construct routing tables with an average ...
C. Gotsman, Kai Hormann
semanticscholar   +1 more source

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs

International Symposium on Computational Geometry, 2020
We present an algorithm for the extensively studied Long Path and Long Cycle problems on unit disk graphs that runs in time $2^{O(\sqrt{k})}(n+m)$. Under the Exponential Time Hypothesis, Long Path and Long Cycle on unit disk graphs cannot be solved in ...
F. Fomin, D. Lokshtanov, Fahad Panolan, Saket Saurabh, M. Zehavi   +4 more
semanticscholar   +1 more source

Bisectored unit disk graphs

Networks, 2004
AbstractUnit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at transmitter sites.
openaire   +1 more source

Hierarchically specified unit disk graphs

1994
We characterize the complexity of several basic optimization problems for unit disk graphs specified hierarchically as in [LW87a, Le88, LW92]. Both PSPACE-hardness results and polynomial time approximations are presented for most of the problems considered.
M. V. Marathe, V. Radhakrishnan, H. B. Hunt, S. S. Ravi   +3 more
openaire   +1 more source

Ad hoc networks beyond unit disk graphs

Wireless Networks, 2003
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical real-world networks while at the same time being concise enough to promote strong theoretical results.
Kuhn, Fabian, Wattenhofer, Roger, Zollinger, Aaron   +2 more
openaire   +2 more sources

Semi-total Domination in Unit Disk Graphs

International Conference on Algorithms and Discrete Applied Mathematics
Sasmita Rout, G. K. Das
semanticscholar   +2 more sources

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs

Canadian Conference on Computational Geometry
Let $V$ be a set of $n$ points in the plane. The unit-disk graph $G = (V, E)$ has vertex set $V$ and an edge $e_{uv} \in E$ between vertices $u, v \in V$ if the Euclidean distance between $u$ and $v$ is at most 1.
Bruce W. Brewer, Haitao Wang
semanticscholar   +1 more source

Target exploration by Nomadic Lévy walk on unit disk graphs

International Journal of Grid and Utility Computing, 2020
Levy walk has attracted attention for its search efficiency. Homesick Levy walk is a family of random walks whose encounter probability of one another is similar to the one of human behaviour.
K. Sugihara, Naohiro Hayashibara
semanticscholar   +1 more source

CDS in Unit Disk Graph

2012
A unit disk is a disk with diameter one. Denote by disk r (o) the disk with center o and radius r. A graph G = (V, E) is called a unit disk graph if it can be embedded into the Euclidean plane such that an edge between two nodes u and v exists if and only if disk0. 5(u) ∩ disk0. 5(v)≠∅, that is, their Euclidean distance d(u, v) ≤ 1. The unit disk graph
Ding-Zhu Du, Peng-Jun Wan
openaire   +1 more source

Liar’s dominating set problem on unit disk graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramesh K. Jallu, Gautam K. Das
openaire   +2 more sources