scientific article; zbMATH DE number 2119732

MaRDI QIDQ4829006zbMATH OpenFDO

Authors Seth Pettie, Vijaya Ramachandran

Publication date 29 November 2004

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Randomized minimum spanning tree algorithms using exponentially fewer random bits
• An optimal minimum spanning tree algorithm
• scientific article; zbMATH DE number 1670813
• A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
• A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

Cited in

(5)

• Randomized minimum spanning tree algorithms using exponentially fewer random bits
• The randomized complexity of maintaining the minimum
• The saga of minimum spanning trees
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• On Cartesian trees and range minimum queries

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