2–3 heap

Known as: 2-3 heap

In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2003

2003

Theory of 2-3 Heaps

T. Takaoka
Discret. Appl. Math.
2003
Corpus ID: 36785030

2003

2003

Theory of 2-3 Heaps

T. Takaoka
Discret. Appl. Math.
2003
Corpus ID: 38830711

1999

1999

A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm

S. Saunders
1999
Corpus ID: 54798185

Dijkstra's algorithm computes the shortest paths between a starting vertex and each other vertex in a directed graph. The…