Seth Pettie. An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. Combinatorica, 26(2):207-230, 2006. [doi]
@article{Pettie06,
title = {An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification},
author = {Seth Pettie},
year = {2006},
doi = {10.1007/s00493-006-0014-1},
url = {http://dx.doi.org/10.1007/s00493-006-0014-1},
researchr = {https://researchr.org/publication/Pettie06},
cites = {0},
citedby = {0},
journal = {Combinatorica},
volume = {26},
number = {2},
pages = {207-230},
}