Network flow

Maximum flow

Minimum cost flow

Graph

Minimum spanning tree

• Borůvka's algorithm
• Kruskal's algorithm
• Prim's algorithm

Stringology

String searching

• Boyer-Moore algorithm

border function

• Knuth-Morris-Pratt algorithm on tries

Suffix array

• Ko-Aluru algorithm for constructing suffix arrays (space consumption is reduced to 2n words + n bits)

Suffix tree

• Ukkonen's algorithm for constructing generalized suffix trees