A simpler minimum spanning tree verification algorithm
From MaRDI portal
Publication:1355729
DOI10.1007/BF02526037zbMATH Open0868.68061OpenAlexW2089290774MaRDI QIDQ1355729FDOQ1355729
Authors: Valerie King 
Publication date: 28 May 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02526037
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Applications of Path Compression on Balanced Trees
- Linear verification for spanning trees
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- A randomized linear-time algorithm to find minimum spanning trees
Cited In (16)
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- Title not available (Why is that?)
- Succinct indices for path minimum, with applications
- Optimal Algorithms for Geometric Centers and Depth
- Distributed verification of minimum spanning trees
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- CASCADING RANDOM WALKS
- Linear verification for spanning trees
- A simpler minimum spanning tree verification algorithm
- The saga of minimum spanning trees
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
- Verifying minimum stable circuit values
- A practical minimum spanning tree algorithm using the cycle property
- A new algorithm for the minimum spanning tree verification problem
- Tight bounds for distributed minimum-weight spanning tree verification
- Streaming graph computations with a helpful advisor
This page was built for publication: A simpler minimum spanning tree verification algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355729)
