Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs.

Till Blume David Richerby Ansgar Scherp

Published in: CoRR (2021)

Keyphrases

memory efficient
learning algorithm
graph based algorithm
graph search
detection algorithm
k means
optimal solution
np hard
matching algorithm
iterative deepening
dynamic programming
worst case
expectation maximization
graph structure
search space
depth first search
computational complexity
maximum flow