“…Second, different works focus on solving a specific graph problem in a streaming setting. Targeted problems include graph clustering [103], mining periodic cliques [174], search for persistent communities [140], [176], tracking conductance [84], event pattern [166] and subgraph [162] discovery, solving ego-centric queries [161], pattern detection [53], [85], [186], [131], [141], [194], [54], [86], densest subgraph identification [113], frequent subgraph mining [19], dense subgraph detection [145], construction and querying of knowledge graphs [52], stream summarization [92], graph sparsification [11], [25], k-core maintenance [13], shortest paths [193], Betweenness Centrality [104], [199], [192], Triangle Counting [147], Katz Centrality [203], mincuts [133], [89] Connected Components [151], or PageRank [97], [55].…”