Loading...
research article
Maintaining minimum spanning forests in dynamic graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o(sqrt(n)) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 log n) per update, with O(1) worst case time per query.
Loading...
Name
HenzingerK01.pdf
Access type
openaccess
Size
145.77 KB
Format
Adobe PDF
Checksum (MD5)
37489f8c17c3129c9410c8863e1a99c0