Zusammenfassung
Mutually connected components (MCCs) play an important role as a measure of
resilience in the study of interconnected networks. Despite their importance,
an efficient algorithm to obtain physical properties of all MCCs during the
removals of links is not available. Here, using a well-known fully-dynamic
graph algorithm, we propose an efficient algorithm to accomplish this. We show
that the time complexity of this algorithm is approximately
\$O(N^1.2)\$, which is more efficient than the brute-force algorithm
with complexity \$O(N^2)\$. We anticipate this algorithm to allow
simulations with complex dynamic rules to research a size regime that was not
permitted before.
Nutzer