Sciweavers

966 search results - page 131 / 194
» Small Alliances in Graphs
Sort
View
COMPLEX
2009
Springer
14 years 4 months ago
Synchronization Stability of Coupled Near-Identical Oscillator Network
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
Jie Sun, Erik M. Bollt, Takashi Nishikawa
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
INFOCOM
2007
IEEE
14 years 4 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
STACS
2007
Springer
14 years 4 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 4 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck