4 search results - page 1 / 1 » Maintaining a Minimum Spanning Tree Under Transient Node Fai... |
163
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
136
Voted
ESA
1998
Springer
15 years 10 months ago
1998
Springer
166
Voted
WDAG
2007
Springer
15 years 12 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
164
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...