Triple
T13529819
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | S. Rao Kosaraju |
E323101
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Kosaraju's algorithm
Kosaraju's algorithm is a graph traversal method used to efficiently find all strongly connected components in a directed graph.
|
E1045495
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d80766a21881909f21a1b7421d3b8a |
elicitation | completed |
| NER | batch_69dbafba2c308190873efd15dfe26358 |
ner | completed |
| NED1 | batch_69f7549fc5f881908691eb62c1f5a5d5 |
ned_source_triple | completed |
| NED2 | batch_69f75a2107e081909fd00af67938f2e9 |
ned_description | completed |
| NEDg | batch_69f7565846108190bb6550505af8ac5d |
nedg | completed |
Created at: April 9, 2026, 9:44 p.m.