Maintaining minimum spanning trees in dynamic graphs
Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Scopus indexed
Author
Henzinger, MonikaISTA 
;
King, Valerie
;
King, ValerieSeries Title
LNCS
Abstract
We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/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(n 1/3 log n) per update, with O(1) worst case time per query.
Publishing Year
Date Published
1997-07-01
Proceedings Title
24th International Colloquium on Automata, Languages and Programming
Volume
1256
Page
594–604
Conference
ICALP: International Colloquium on Automata, Languages, and Programming
Conference Location
Bologna, Italy
Conference Date
1997-07-07 – 1997-07-11
ISBN
ISSN
eISSN
IST-REx-ID
Cite this
Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: 24th International Colloquium on Automata, Languages and Programming. Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214
Henzinger, M. H., & King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In 24th International Colloquium on Automata, Languages and Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. https://doi.org/10.1007/3-540-63165-8_214
Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In 24th International Colloquium on Automata, Languages and Programming, 1256:594–604. Springer Nature, 1997. https://doi.org/10.1007/3-540-63165-8_214.
M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.
Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” 24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:10.1007/3-540-63165-8_214.
Google Scholar
ISBN Search