scientific article; zbMATH DE number 4199627

MaRDI QIDQ3348416zbMATH OpenFDO

Authors Zheng Jiang

Publication date 1990

zbMATH Keywords

minimum spanning treeupdating\(\Sigma \) -treeCREW-PRAM model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• An efficient parallel algorithm for updating minimum spanning trees
• Optimal parallel algorithms for multiple updates of minimum spanning trees
• A Parallel Algorithm for Computing Minimum Spanning Trees
• An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs
• scientific article; zbMATH DE number 24457
• Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
• scientific article; zbMATH DE number 3956442
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph

Cited in

(3)

• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• An efficient parallel algorithm for updating minimum spanning trees
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348416)