Algorithms for All Single Deletions in a Minimum Spanning Tree, Simultaneously
Year: 1995
Type: article
Abstract: o n reverse if necessary a n d identify by b lo ck nu m b e r) FIELD GROUP SUB-GROUP minimum spanning tree, edge deletion, node deletion, graph algorithm, parallel algorithm 19.ABSTRACT (C o n tin u o o n reverse if necessary t n d identify by block n u m b o r)Let T be a minimum spanning tree of a biconnected graph G -{V,E) with weighted edges.Let m = \E\ and n = |V|.We present sequential and parallel algorithms for deter mining the minimum spanning tree of each graph G -t for all edges t in T and each graph G -v for all v in V, simultaneously.For an edge t in T, define the replacement for t to be the minimum weight edge e that connects the two components of T after t is deleted.For a node v in T, define the replacement for v to be the minimum weight set of edges, R(v), that connect the & t{v) -1 components of T after v is deleted, where 5t (v) is the tree degree of i).Our sequential algorithms for finding all edge replacements and for finding all node replacements run in 0 (m) and 0 (m + na(n)) time, respectively, assuming that the edges are sorted by weight.Our parallel algorithms for these problems run in O(logn) and 0 (log2 n) time, respectively, using m processors on a CREW PRAM.
Authors: Bevan Das, Michael C. Loui
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2589500452
