Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Aaman, Anders"'
Autor:
Aaman, Anders, Karczmarz, Adam, Łącki, Jakub, Parotsidis, Nikos, Rasmussen, Peter M. R., Thorup, Mikkel
We present a dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions. The algorithm is Monte-Carlo randomized and processes any sequence of edge deletions in $O(m + n \operatorn
Externí odkaz:
http://arxiv.org/abs/2111.09376
