Reflected min-Max heaps (Q1007603): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:22, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Reflected min-Max heaps	scientific article

Statements

scholarly article

0 references

Reflected min-Max heaps (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0020-0190(02)00501-X

0 references

Christos Makris

0 references

Kostas Tsichlas

0 references

Athanasios K. Tsakalidis

0 references

Information Processing Letters

0 references

publication date

23 March 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

algorithms

0 references

data structures

0 references

priority queues

0 references

worst-case complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

Symmetric min-max heap: a simpler data structure for double-ended priority queue

0 references

Min-max heaps and generalized priority queues

0 references

Fast meldable priority queues

0 references

0 references

0 references

The relaxed min-max heap: A mergeable double-ended priority queue

0 references

A generalization of binomial queues

0 references

Fibonacci heaps and their uses in improved network optimization algorithms

0 references

0 references

0 references

A data structure for manipulating priority queues

0 references

full work available at URL

https://doi.org/10.1016/s0020-0190(02)00501-x

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1007603

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1007603&oldid=37061992"