Dynamic Graph Algorithms

Dynamic graph algorithms compute the graph properties from the previous set of values. Typical operations in dynamic graph algorithms are insertion and deletion of edges and vertices, and the query for property values relevant to the algorithm. The efficiency of a dynamic algorithm depends on the data structure used to implement it. This chapter provides a glimpse into this exciting area in graph analytics.