Results 21 to 30 of about 124,454 (161)
International Journal of Distributed Sensor Networks, 2017 The high attenuation of radio signals in water leaves acoustic waves the most viable communication media for underwater sensor networks. Nevertheless, acoustic communication suffers from significantly high latency because of its low propagation speed ...
Xin Bai, Xiaohui Wei, Sen Bai
doaj +1 more source
Spanners for geometric intersection graphs with applications
Journal of Computational Geometry, 2012 A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real numbert>1, we say that a subgraph G' of a graph G is a t-spanner of G, if for every pair of verticesu,v in G, there exists a path in G' of length at most t ...
Martin Fürer +1 more
doaj +1 more source
Families of Riemann Surfaces, Uniformization and Arithmeticity [PDF]
, 2016 A consequence of the results of Bers and Griffiths on the uniformization of complex algebraic varieties is that the universal cover of a family of Riemann surfaces, with base and fibers of finite hyperbolic type, is a contractible 2-dimensional domain ...
González-Diez, Gabino +1 more
core +2 more sources
On the Complexity of Target Set Selection in Simple Geometric Networks [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual
Michal Dvořák +2 more
doaj +1 more source
Planar subgraphs without low-degree nodes [PDF]
, 2011 We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k.
A. Liebers +9 more
core +2 more sources
Hierarchically specified unit disk graphs
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marathe, Madhav V. +3 more
openaire +1 more source
Complexity, 2020 In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB.
Jiarong Liang +5 more
doaj +1 more source
Reverse Shortest Path Problem for Unit-Disk Graphs [PDF]
, 2021 Given a set P of n points in the plane, the unit-disk graph Gr(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 weight of the edge is 1 in the unweighted case and is the distance between p and q in the weighted case).
Wang, Haitao, Zhao, Yiming
openaire +4 more sources
A novel centralized algorithm for constructing virtual backbones in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking, 2018 Finding the minimum connected dominating set (MCDS) is a key problem in wireless sensor networks, which is crucial for efficient routing and broadcasting. However, the MCDS problem is NP-hard.
Chuanwen Luo +4 more
doaj +1 more source
Network Localization on Unit Disk Graphs [PDF]
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011 5 ...
Kaewprapha, Phisan +2 more
openaire +2 more sources