Sciweavers

SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
13 years 10 months ago
Finding the k Smallest Spanning Trees
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...
David Eppstein
SWAT
1990
Springer
72views Algorithms» more  SWAT 1990»
13 years 10 months ago
Generating Sparse Spanners for Weighted Graphs
Ingo Althöfer, Gautam Das, David P. Dobkin, D...
SWAT
1990
Springer
66views Algorithms» more  SWAT 1990»
13 years 10 months ago
Expected Behaviour Analysis of AVL Trees
Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Zi...