Sciweavers

659 search results - page 14 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
WG
2009
Springer
14 years 2 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
WG
2005
Springer
14 years 28 days ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
ICC
2008
IEEE
108views Communications» more  ICC 2008»
14 years 1 months ago
Minimizing Interferences in Wireless Ad Hoc Networks through Topology Control
— This paper investigates minimizing mutual interferences in wireless ad hoc networks by means of topology control. Prior work defines interference as a relationship between link...
Guinian Feng, Soung Chang Liew, Pingyi Fan