scientific article; zbMATH DE number 3956442

MaRDI QIDQ3725547zbMATH OpenFDO

Authors Peter J. Varman, Kshitij Doshi

Publication date 1986

zbMATH Keywords

parallel algorithmparallel random access machine

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An efficient parallel algorithm for updating minimum spanning trees
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• scientific article; zbMATH DE number 3965451
• Optimal parallel algorithms for multiple updates of minimum spanning trees
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph

Cited in

(9)

• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph
• An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs
• scientific article; zbMATH DE number 4199627 (Why is no real title available?)
• scientific article; zbMATH DE number 3965451 (Why is no real title available?)
• Incremental distributed asynchronous algorithm for minimum spanning trees
• scientific article; zbMATH DE number 2237504 (Why is no real title available?)

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 Q3725547)