An inverse-Ackermann style lower bound for the online minimum spanning tree veri problem (0)

by S Pettie
Venue:in: Proc. 43rd Annual Symposium on Foundations of Computer Science (FOCS'02