Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
finite directed graphs
|
| gptkbp:author |
gptkb:Robert_Tarjan
|
| gptkbp:category |
search algorithms
graph algorithms |
| gptkbp:compatibleWith |
undirected graphs
|
| gptkbp:complexity |
linear
O(V+E) |
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
1972
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tarjan's algorithm
|
| gptkbp:input |
graph
|
| gptkbp:namedAfter |
gptkb:Robert_Tarjan
|
| gptkbp:output |
strongly connected components
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:relatedTo |
gptkb:Kosaraju's_algorithm
gptkb:Gabow's_algorithm |
| gptkbp:solvedBy |
strongly connected components problem
|
| gptkbp:step |
assigns index to each node
identifies root nodes of SCCs maintains stack of nodes removes SCCs from stack |
| gptkbp:uses |
depth-first search
|
| gptkbp:bfsParent |
gptkb:Robert_Tarjan
gptkb:Graph_theory |
| gptkbp:bfsLayer |
5
|