Jump to content

Tarjan's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RMCD bot (talk | contribs) at 11:51, 16 November 2020 (Notifying subject page of move discussion on Talk:Tarjan's algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Tarjan's algorithm may refer to:

  • Tarjan's algorithm for finding bridges in an undirected graph[1]
  1. ^ Endre, 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
  2. ^ Endre, Robert E. (1972), "Enumeration of the Elementary Circuits of a Directed Graph", SIAM Journal on Computing, 2 (3): 211–216, doi:10.1137/0202017