An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem | IEEE Conference Publication | IEEE Xplore