Minimum spanning tree verification under uncertainty
From MaRDI portal
Recommendations
- Computing minimum spanning trees with uncertainty
- Minimum spanning tree under explorable uncertainty in theory and experiments
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Randomization helps computing a minimum spanning tree under uncertainty
- A new algorithm for the minimum spanning tree verification problem
Cited in
(15)- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Verification problem of maximal points under uncertainty
- Randomization helps computing a minimum spanning tree under uncertainty
- Minimum spanning tree under explorable uncertainty in theory and experiments
- Computing minimum spanning trees with uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Query minimization under stochastic uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Set selection under explorable stochastic uncertainty via covering techniques
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Reachability in temporal graphs under perturbation
- On the complexity of knapsack under explorable uncertainty: hardness and algorithms
This page was built for publication: Minimum spanning tree verification under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945187)
