Results 31 to 40 of about 124,454 (161)
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
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
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
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
Bidimensionality and Geometric Graphs
, 2011 In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a ...
Fomin, Fedor V. +2 more
core +2 more sources
Void Traversal for Guaranteed Delivery in Geometric Routing
, 2005 Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only.
Nesterenko, Mikhail, Vora, Adnan
core +1 more source
Heuristics for Network Coding in Wireless Networks [PDF]
, 2007 Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from
Adjih, Cédric +2 more
core +4 more sources
Strongly connected dominating set construction algorithm balancing time delay and energy consumption
Tongxin xuebao, 2012 To the asymmetry of link in wireless sensor networks,a problem about the strongly connected dominating tree with bounded transmission delay (SDTT) was put forward.The distributed strongly connected dominating tree (SCDT) algorithm was also proposed to ...
Yan-jing SUN +3 more
doaj +2 more sources
Recognizing Weighted Disk Contact Graphs
, 2015 Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph.
Klemz, Boris +2 more
core +2 more sources