Editing List of algorithms (section)

====Network theory====
{{further|Network theory}}
* Network analysis
** Link analysis
*** [[Girvan–Newman algorithm]]: detect communities in complex systems
*** Web link analysis
**** [[Hyperlink-Induced Topic Search]] (HITS) (also known as [[Hubs and authorities]])
**** [[PageRank]]
**** [[TrustRank]]
* [[Flow network]]s
** [[Dinic's algorithm]]: is a [[strongly polynomial]] algorithm for computing the [[maximum flow]] in a [[flow network]].
** [[Edmonds–Karp algorithm]]: implementation of Ford–Fulkerson
** [[Ford–Fulkerson algorithm]]: computes the [[maximum flow problem|maximum flow]] in a graph
** [[Karger's algorithm]]: a Monte Carlo method to compute the [[minimum cut]] of a connected graph
** [[Push–relabel algorithm]]: computes a [[maximum flow problem|maximum flow]] in a graph