Pages that link to "Item:Q1066909"
From MaRDI portal
The following pages link to Linear verification for spanning trees (Q1066909):
Displaying 12 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)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156) (← links)
- A simpler minimum spanning tree verification algorithm (Q1355729) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems (Q2639778) (← links)
- A simpler minimum spanning tree verification algorithm (Q5057455) (← links)