Skip to search formSkip to main content

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.
2018
2018
University of Florida 8.1 Definition and an Application . . . . . . . . . . . . . . . . . . . . 8-1 8.2 Symmetric Min-Max Heaps… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?
2008
2008
Coupling Capacitor Voltage Transformer (CCVT) secondary voltages, normally applied to conventional schemes, do not comprise… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
2004
2004
  • Sartaj Sahni
  • Handbook of Data Structures and Applications
  • 2004
University of Florida 8.1 Definition and an Application . . . . . . . . . . . . . . . . . . . . 8-1 8.2 Symmetric Min-Max Heaps… Expand
  • figure 8.1
  • figure 8.2
  • figure 8.3
  • figure 8.4
  • figure 8.5
Is this relevant?
2000
2000
We describe three general methods--total, dual, and leaf correspondence--that may be used to derive efficient double-ended… Expand
Is this relevant?
1993
1993
This paper introduces a highly efficient double-ended heap structure called d-b-queues, which are an extension of binomial queues… Expand
Is this relevant?
1987
1987
Abstract This paper presents a symmetrical implicit double-ended priority queue implementation, which can be built in linear time… Expand
Is this relevant?
1982
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
Is this relevant?