396 search results - page 7 / 80 » An Optimal Minimum Spanning Tree Algorithm |
116
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
101
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
137
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
98
Voted
JISE
2008
15 years 2 months ago
2008
101
Voted
GEM
2010
15 years 24 days ago
2010
