Triple
T10700882
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Viterbi algorithm |
E252270
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Bellman–Ford algorithm
The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
|
E880220
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d6aa5cbabc8190973e683950d89faf |
elicitation | completed |
| NER | batch_69d6fd8bb7408190a350840e1df3b910 |
ner | completed |
| NED1 | batch_69d998ed78e481908537ae10d55e6f65 |
ned_source_triple | completed |
| NED2 | batch_69da625a1e8c8190b282e7a70bb7c876 |
ned_description | completed |
| NEDg | batch_69d99e8534688190b312b737e0b9cd53 |
nedg | completed |
Created at: April 8, 2026, 9:12 p.m.