659 search results - page 12 / 132 » Dynamic Algorithms for Graph Spanners |
113
click to vote
MSN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
114
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
145
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
107
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
109
click to vote
TALG
2008
15 years 2 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...