An optimal EREW PRAM algorithm for minimum spanning tree verification
From MaRDI portal
Publication:290239
DOI10.1016/S0020-0190(97)00050-1zbMATH Open1337.68285MaRDI QIDQ290239FDOQ290239
Authors: Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha 
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- Optimal parallel verification of minimum spanning trees in logarithmic time
- A Parallel Algorithm for Computing Minimum Spanning Trees
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improving the efficiency of parallel minimum spanning tree algorithms
- An optimal parallel algorithm for minimum spanning trees in planar graphs
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Applications of Path Compression on Balanced Trees
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear verification for spanning trees
- A simpler minimum spanning tree verification algorithm
- Optimal parallel verification of minimum spanning trees in logarithmic time
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
- Title not available (Why is that?)
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: An optimal EREW PRAM algorithm for minimum spanning tree verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290239)
