C - SNAP - Stanford University

The algorithm:
Use greedy hill-climbing to maximize F C(G):
Start with empty G 0 (G with no edges)
Add k edges (k is parameter)
At every step i add an edge to G i that
maximizes the marginal improvement
12/6/2011 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
[KDD ’10]
36