Fast meldable priority queues (Q5057442)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7633550

Language	Label	Description	Also known as
English	Fast meldable priority queues	scientific article; zbMATH DE number 7633550

Statements

scholarly article

0 references

Fast meldable priority queues (English)

0 references

Gerth Stølting Brodal

0 references

Lecture Notes in Computer Science

0 references

publication date

16 December 2022

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-60220-8_70

0 references

Min-max heaps and generalized priority queues

0 references

0 references

0 references

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

0 references

Fishspear: a priority queue algorithm

0 references

The pairing heap: A new form of self-adjusting heap

0 references

Fibonacci heaps and their uses in improved network optimization algorithms

0 references

Amortized Computational Complexity

0 references

A data structure for manipulating priority queues

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-60220-8_70

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5057442

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