Verifying minimum spanning trees in linear time
From MaRDI portal
Recommendations
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Optimal parallel verification of minimum spanning trees in logarithmic time
- Linear verification for spanning trees
- A simpler minimum spanning tree verification algorithm
- A simpler minimum spanning tree verification algorithm
- A new algorithm for the minimum spanning tree verification problem
- A randomized linear-time algorithm to find minimum spanning trees
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Distributed verification of minimum spanning trees
Cited in
(6)- A simpler minimum spanning tree verification algorithm
- On Linear Time Minor Tests with Depth-First Search
- A simpler minimum spanning tree verification algorithm
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- An inverse-Ackermann type lower bound for online minimum spanning tree verification
This page was built for publication: Verifying minimum spanning trees in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233349)
