Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

5 relations
2–3 treeComputer scienceData structureFibonacci heap
Expand

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: 38830711
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key and… Expand
1999
1999
Theory of 2-3 Heaps
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key, and n… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1999
1999
A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm
Dijkstra's algorithm computes the shortest paths between a starting vertex and each other vertex in a directed graph. The… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE