| 
|
Quote: first fully dynamic algorithm for connectivity, bipartiteness, and approximate minimum spanning tree in polylogarithmic time per edge; randomized, efficient; sparse cuts near root
topics >
all references >
references g-h >
Topic:
probabilistic and randomized algorithms
Topic:
graphs
Quotation Skeleton
This paper solves a longstanding open problem in … minimum spanning trees in polylogarithmic time per edge … graph decomposition with randomization. They are Las-Vegas type … [p. 504] The edges of the graph are partitioned … are dense) are on lower levels than those … for the graph whose edges are in levels … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: probabilistic and randomized algorithms (11 items)
Topic: graphs (18 items)