Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:author |
gptkb:Robert_Tarjan
|
| gptkbp:category |
gptkb:algorithm
gptkb:graph |
| gptkbp:complexity |
O(V+E)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
1972
|
| gptkbp:input |
gptkb:graph
|
| gptkbp:namedAfter |
gptkb:Robert_Tarjan
|
| gptkbp:output |
bridges
articulation points strongly connected components |
| gptkbp:relatedTo |
gptkb:Depth-first_search
gptkb:Kosaraju's_algorithm |
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:usedFor |
finding strongly connected components
finding articulation points finding bridges in a graph |
| gptkbp:bfsParent |
gptkb:Graph_Algorithms
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tarjan's Algorithm
|