Dynamic Graph Algorithms Using Dynamic Forest Techniques

@inproceedings{llwu2014DynamicGA,
  title={Dynamic Graph Algorithms Using Dynamic Forest Techniques},
  author={Lawrence Wu llwu},
  year={2014}
}
  • Lawrence Wu llwu
  • Published 2014
A dynamic graph problem is a problem of maintaining a graph subject to edge insertions and/or deletions, and queries about some property of the graph. An incremental dynamic graph algorithm supports just edge insertions, a decremental dynamic graph algorithm supports just edge deletions, and a fully dynamic graph algorithm supports both edge insertions and deletions. In this paper, we survey some of the currently best results in dynamic graph algorithms, first describing the dynamic forest data… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

74 Citations

051015'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

  • J. Holm, S. Alstrup, K. de Lichtenburg, M. Thorup
  • In Journal of the ACM (JACM),
  • 2001
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…