Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including:

See also

edit

References

edit
  1. ^ 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
  2. ^ 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

📚 Artikel Terkait di Wikipedia

Tarjan's strongly connected components algorithm

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph

Dominator (graph theory)

Lengauer and Tarjan developed an algorithm which is almost linear, and in practice, except for a few artificial graphs, the algorithm and a simplified

Robert Tarjan

Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including

Dijkstra's algorithm

original algorithm ran in Θ ( | V | 2 ) {\displaystyle \Theta (|V|^{2})} time, where | V | {\displaystyle |V|} is the number of nodes. Fredman & Tarjan 1984

Strongly connected component

this algorithm was published by Edsger W. Dijkstra in 1976. Although Kosaraju's algorithm is conceptually simple, Tarjan's and the path-based algorithm require

Tarjan's off-line lowest common ancestors algorithm

In computer science, Tarjan's off-line lowest common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a

Prim's algorithm

In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a

Biconnected component

classic sequential algorithm for computing biconnected components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973). It runs