3 search results - page 1 / 1 » swat 1990 |
69
Voted
SWAT
1990
Springer
15 years 2 months ago
1990
Springer
61
Voted
SWAT
1990
Springer
15 years 2 months ago
1990
Springer
70
Voted
SWAT
1990
Springer
15 years 2 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...