| 
|
QuoteRef: henzMR7_1999
topics >
all references >
ThesaHelp:
references g-h
ThesaHelp:
ACM references f-l
Topic:
probabilistic and randomized algorithms
Topic:
graphs
Reference
Henzinger, M.R., King, V., "Randomized fully dynamic graph algorithms with polylogarithmic time per operation", Journal of the ACM, 46, 4, July 1999, pp. 502-516. Google
abstract ;;Quote: first fully dynamic algorithm for connectivity, bipartiteness, and approximate minimum spanning tree in polylogarithmic time per edge; randomized, efficient; sparse cuts near root
ThesaHelp: references g-h (299 items)
ThesaHelp: ACM references f-l (241 items)
Topic: probabilistic and randomized algorithms (11 items)
Topic: graphs (18 items)