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

Double-ended priority queue

Known as: DEPQ, Double ended heaps (deaps), Double-ended heap 
In computer science, a double-ended priority queue (DEPQ) or double-ended heap is a data structure similar to a priority queue or heap, but allows… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In rail freight operation, freight cars need to be separated and reformed into new trains at hump yards. The classification… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
2008
2008
AbstractWe introduce two data-structural transformations to construct double-ended priority queues from priority queues. To apply… Expand
  • table 1
  • figure 1
  • figure 2
2007
2007
Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to… Expand
  • table 1
2007
2007
We establish that, given $\Sigma$ a compact orientable surface, and $G$ a finitely presented one-ended group, the set of copies… Expand
  • figure 1
  • figure 2
  • figure 3
2003
2003
In this paper, we present improved algorithms for min-max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended… Expand
2000
2000
We describe three general methods--total, dual, and leaf correspondence--that may be used to derive efficient double-ended… Expand
1994
1994
This paper presents a very general technique for the implementation of mergeable priority queues. \par The amortized running time… Expand
Highly Cited
1987
Highly Cited
1987
Abstract This paper presents a symmetrical implicit double-ended priority queue implementation, which can be built in linear time… Expand
Highly Cited
1986
Highly Cited
1986
A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built… Expand
  • figure 1
  • table I
  • table II
Highly Cited
1982
Highly Cited
1982
We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 2
  • figure 5