Parametric and kinetic minimum spanning trees

We consider the parametric minimum spanning free problem, in which we are given a graph with edge rt eights that are linear functions of a parameter lambda and wish to compute the sequence of minimum spanning trees generated as fi varies. We also consider the kinetic minimum spanning tree problem, in which lambda represents time and the graph is subject in addition to changes such as edge insertions, deletions, and modifications of the weight functions as time progresses. We solve both problems in time O(n(2/3) log(4/3) n) per combinatorial change in the tree (or randomized O(n(2/3) log n) per change). Our time bounds reduce to O(n(1/2) log(3/2) n) per change (O(n(1/2) log n) randomized) for planar graphs or other minor-closed families of graphs, and O (n(1/4) log(3/2) n) per change (O(n(1/4) log n) randomized) for planar graphs with weight changes but no insertions or deletions.