Bruce M. Kapron, Valerie King, Ben Mountjoy. Dynamic graph connectivity in polylogarithmic worst case time. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1131-1142, SIAM, 2013. [doi]
@inproceedings{KapronKM13,
title = {Dynamic graph connectivity in polylogarithmic worst case time},
author = {Bruce M. Kapron and Valerie King and Ben Mountjoy},
year = {2013},
url = {http://knowledgecenter.siam.org/0236-000016/},
researchr = {https://researchr.org/publication/KapronKM13},
cites = {0},
citedby = {0},
pages = {1131-1142},
booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
editor = {Sanjeev Khanna},
publisher = {SIAM},
}