THE RELAXED MIN-MAX HEAP - A MERGEABLE DOUBLE-ENDED PRIORITY QUEUE Article

DING, YZ, WEISS, MA. (1993). THE RELAXED MIN-MAX HEAP - A MERGEABLE DOUBLE-ENDED PRIORITY QUEUE . ACTA INFORMATICA, 30(3), 215-231. 10.1007/BF01179371

keywords

  • ALGORITHMS
  • Computer Science
  • Computer Science, Information Systems
  • FIBONACCI HEAPS
  • MERGING HEAPS
  • Science & Technology
  • Technology

Digital Object Identifier (DOI)

publisher

  • SPRINGER VERLAG

start page

  • 215

end page

  • 231

volume

  • 30

issue

  • 3