Tarjan's algorithm

In graph theory, different algorithms are named after Robert Tarjan :

• The Tarjan's strongly connected components algorithm
• The algorithm of Tarjan for determining a minimum spanning tree
• The algorithm of Goldberg and Tarjan (A generic method for solving Max-Flow )

This is a disambiguation page for differentiating between several terms identified with the same word.