Results 31 to 40 of about 124,717 (298)
Simple heuristics for unit disk graphs [PDF]
Networks, 1995 AbstractUnit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP‐hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring, and minimum dominating set.
Marathe, M. V. +4 more
openaire +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
Quantum walks: The mean first detected transition time
Physical Review Research, 2020 We consider the quantum first detection problem for a particle evolving on a graph under repeated projective measurements with fixed rate 1/τ. A general formula for the mean first detected transition time is obtained for a quantum walk in a finite ...
Q. Liu, R. Yin, K. Ziegler, E. Barkai
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
Biharmonic Maps and Laguerre Minimal Surfaces
Abstract and Applied Analysis, 2013 A Laguerre surface is known to be minimal if and only if its corresponding isotropic map is biharmonic. For every Laguerre surface Φ is its associated surface Ψ=1+u2Φ, where u lies in the unit disk.
Yusuf Abu Muhanna, Rosihan M. Ali
doaj +1 more source
Approximation Algorithms for Unit Disk Graphs [PDF]
, 2005 We consider several graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set) relevant to mobile ad hoc networks. We propose two new notions: thickness and density. If the thickness of a unit disk graph is bounded, then the mentioned problems can be solved in polynomial time ...
openaire +3 more sources
An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks
The Scientific World Journal, 2015 A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same ...
Chakradhar Penumalli, Yogesh Palanichamy
doaj +1 more source
Maxclique and unit disk characterizations of strongly chordal graphs
Discussiones Mathematicae Graph Theory, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pablo De Caria, Terry A. McKee
openalex +5 more sources
Performance Evaluation of a Topology Control Algorithm for Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2010 A main design challenge in the area of sensor networks is energy efficiency to prolong the network operable lifetime. Since most of the energy is spent for radio communication, an effective approach for energy conservation is scheduling sleep intervals ...
Nedal Ababneh
doaj +1 more source