Abstract
Given an undirected graph, its arboricity is the minimum number of edge disjoint forests, its edge set can be partitioned into. We develop the first fully dynamic algorithms to determine the arboricity of a graph under edge insertions and deletions. While our insertion algorithm is based on known static algorithms to determine the arboricity, our deletion algorithm is, to the best of our knowledge, new.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have