scientific article; zbMATH DE number 3965451

MaRDI QIDQ3732971zbMATH OpenFDO

Authors Deepak Sherlekar, I. V. Ramakrishnan, Shaunak R. Pawagi

Publication date 1985

zbMATH Keywords

bridgesconnected componentsFast parallel algorithmsminimum spanning treesparallel random access machineundirected graphupdating of subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An efficient parallel algorithm for updating minimum spanning trees
• scientific article; zbMATH DE number 3956442
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• scientific article; zbMATH DE number 554530
• Optimal parallel algorithms for multiple updates of minimum spanning trees

Cited in

(3)

• Work-efficient parallel union-find with applications to incremental graph connectivity
• Work-sensitive dynamic complexity of formal languages
• scientific article; zbMATH DE number 3956442 (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 Q3732971)