Dynamic graph connectivity in polylogarithmic worst case time

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.