BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR91-159
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Optimal Parallel and Sequential Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Johnson, Donald B.
AUTHOR:: Metaxas, Panagiotis
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1991
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR91-159.pdf
ABSTRACT::
	We present a set of rules that can be used to give optimal
solutions to the vertex updating problem for a minimum spanning tree:
Update a given MST when a new vertex z is introducted, along with
weighted edges that connect z with the vertices of the graph.  These
rules lead to simple parallel algorithms that run in O(lg n) parallel
time using n/lg n EREW PRAMs.  They can also be used to derive simple
linear-time sequential algorithms for the same problem.  Furthermore,
we show how our solution can be used to solve the multiple vertex
updating problem.
END:: ncstrl.dartmouthcs//TR91-159