Triple
T3043245
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert Tarjan |
E83180
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Tarjan's algorithm for strongly connected components
Tarjan's algorithm for strongly connected components is a depth-first search–based graph algorithm that efficiently finds all strongly connected components of a directed graph in linear time.
|
E83180
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad8b2298908190a7cb4e9bdbf064d0 |
elicitation | completed |
| NER | batch_69ad9b5ec5988190b8b6c95c743c6d1e |
ner | completed |
| NED1 | batch_69b1ded35e008190be7dd72aa7537a3b |
ned_source_triple | completed |
| NED2 | batch_69b1e0243a848190bce24d035a79fc0a |
ned_description | completed |
| NEDg | batch_69b1dfa2fb28819089d7d76d9dc72e06 |
nedg | completed |
Created at: March 8, 2026, 3:01 p.m.