Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

DOI10.7155/jgaa.00365zbMath1323.05123OpenAlexW2401641833MaRDI QIDQ3196316

Seth Pettie

Publication date: 29 October 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00365

zbMATH Keywords

deterministic algorithmrandomized linear time MST algorithmsplit-findmin data structure

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (2)

A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges ⋮ Auction algorithm sensitivity for multi-robot task allocation

This page was built for publication: Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time