Incremental Graphlet Counting for Network Optimisation
Calculate changes in orbit counts
Calculate orbit counts from scratch
Contains
Modify edge
Generate a dynamic network
Neighbours
IncGraph: incremental graphlet counting for network optimisation
Network as matrix
IncGraph network
Modify edge
Reset network
Set a given network to contain the given links
An efficient and incremental approach for calculating the differences in orbit counts when performing single edge modifications in a network. Calculating the differences in orbit counts is much more efficient than recalculating all orbit counts from scratch for each time point.