Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Artificial_Intelligence
|
| gptkbp:applies_to |
graph theory
|
| gptkbp:capacity |
O(V)
|
| gptkbp:designed_by |
gptkb:Robert_Tarjan
|
| gptkbp:developed_by |
gptkb:1972
|
| gptkbp:duration |
O(V + E)
|
| gptkbp:has_programs |
gptkb:Artificial_Intelligence
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tarjan's Algorithm
|
| gptkbp:input_output |
directed graph
strongly connected components |
| gptkbp:is_effective_against |
large graphs
|
| gptkbp:is_implemented_in |
iterative form
recursive form |
| gptkbp:is_part_of |
graph algorithms
|
| gptkbp:is_similar_to |
Kosaraju's Algorithm
|
| gptkbp:is_used_for |
finding strongly connected components
|
| gptkbp:is_used_in |
social network analysis
network analysis compiler optimization |
| gptkbp:named_after |
gptkb:Robert_Tarjan
|
| gptkbp:related_to |
depth-first search
|
| gptkbp:utilizes |
low-link values
|
| gptkbp:bfsParent |
gptkb:Ruth_Tarjan
|
| gptkbp:bfsLayer |
5
|