Tarjan's algorithm
Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including:
- Tarjan's strongly connected components algorithm
- Tarjan's off-line lowest common ancestors algorithm
- Tarjan's algorithm for finding bridges in an undirected graph[1]
- Tarjan's algorithm for finding simple circuits in a directed graph[2]
See also
References
- ^ Tarjan, Robert E. (1974), "A Note on Finding the Bridges of a Graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9
- ^ Tarjan, Robert E. (1972), "Enumeration of the Elementary Circuits of a Directed Graph", SIAM Journal on Computing, 2 (3): 211–216, doi:10.1137/0202017, hdl:1813/5941
This set index article includes a list of related items that share the same name (or similar names).
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.