
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
