We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time
O
(
n
1/2
) per change; 3-edge connectivity, in time
O
(
n
2/3
) per change; 4-edge connectivity, in time
O
(
n
α(
n
)) per change;
k
-edge connectivity for constant
k
, in time
O
(
n
log
n
) per change;2-vertex connectivity, and 3-vertex connectivity, in the
O
(
n
) per change; and 4-vertex connectivity, in time
O
(
n
α(
n
)) per change. Further results speed up the insertion times to match the bounds of known partially dynamic algorithms.
All our algorithms are based on a new technique that transforms an algorithm for sparse graphs into one that will work on any graph, which we call
sparsification.
This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems.
Dynamic programming solutlons to a number of different recurrence equations for sequence comparison and for RNA secondary structure prediction are considered. These recurrences are defined over a number of points that is quadratic in the input size; however only a sparse set matters for the result. Efficient algorithms for these problems are given, when the weight functions used in the recurrences are taken to be linear. The time complexity of the algorithms depends almost linearly on the number of points that need to be considered; when the problems are sparse this results in a substantial speed-up over known algorithms.
This paper surveys algorithmic techniques and data structures that have been proposed tosolve thesetunion problem and its variants, Thediscovery of these data structures required anew set ofalgorithmic tools that have proved useful in other areas. Special attention is devoted to recent extensions of the original set union problem, and an attempt is made to provide a unifying theoretical framework for this growing body of algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.