Triple
T13507223
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fibonacci heap |
E321043
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object |
pairing heap (as a practical alternative)
A pairing heap is a simple, self-adjusting heap data structure that offers efficient practical performance for priority queue operations and is often used as an alternative to more complex structures like Fibonacci heaps.
|
E1045596
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d807629d6c8190998f1b9bb12d2ed0 |
elicitation | completed |
| NER | batch_69dbaf8259a08190ada13c4a3078f07d |
ner | completed |
| NED1 | batch_69f7548e51b881909a3384812556bc3d |
ned_source_triple | completed |
| NED2 | batch_69f757e7322c8190b0e36e8373d42ac4 |
ned_description | completed |
| NEDg | batch_69f757108e088190aeec031eccc9aca3 |
nedg | completed |
Created at: April 9, 2026, 9:43 p.m.