Triple
T3043276
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert Tarjan |
E83180
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
|
E323102
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad8b2298908190a7cb4e9bdbf064d0 |
elicitation | completed |
| NER | batch_69ad9b5ec5988190b8b6c95c743c6d1e |
ner | completed |
| NED1 | batch_69b1eef43da8819094cd438c93c64c86 |
ned_source_triple | completed |
| NED2 | batch_69b1f16489e881909368470bb53a900c |
ned_description | completed |
| NEDg | batch_69b1f071a53481908fb1d7b9803c65a6 |
nedg | completed |
Created at: March 8, 2026, 3:01 p.m.