Minimum Spanning Tree Verification Under Uncertainty
From MaRDI portal
Publication:2945187
DOI10.1007/978-3-319-12340-0_14zbMath1417.68290OpenAlexW59523525MaRDI QIDQ2945187
No author found.
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12340-0_14
Trees (05C05) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ Query-competitive sorting with uncertainty ⋮ Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ⋮ Set selection under explorable stochastic uncertainty via covering techniques ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty ⋮ Query minimization under stochastic uncertainty ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
This page was built for publication: Minimum Spanning Tree Verification Under Uncertainty
