613 search results - page 17 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
174
Voted
DEXA
2010
Springer
15 years 6 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
167
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
222
Voted
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
182
Voted
EUROCAST
2009
Springer
16 years 28 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
181
Voted
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...