Pages that link to "Item:Q1355729"
From MaRDI portal
The following pages link to A simpler minimum spanning tree verification algorithm (Q1355729):
Displaying 17 items.
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
- Verifying minimum stable circuit values (Q1007566) (← links)
- Linear verification for spanning trees (Q1066909) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- A new algorithm for the minimum spanning tree verification problem (Q2340495) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- An optimal minimum spanning tree algorithm (Q3196633) (← links)
- (Q4233349) (← links)
- A simpler minimum spanning tree verification algorithm (Q5057455) (← links)
- CASCADING RANDOM WALKS (Q5462126) (← links)
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees (Q5851104) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Algorithms - ESA 2003 (Q5897286) (← links)
