Faster Deterministic Fully-Dynamic Graph Connectivity
Faster Deterministic Fully-Dynamic Graph Connectivity
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Faster Deterministic Fully-Dynamic Graph ConnectivityChristian Wulff-NilsenChristian Wulff-Nilsenpp.1757 - 1769Chapter DOI:https://doi.org/10.1137/1.9781611973105.126PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports updates (edge insertions/deletions) in O(log2 …