The soft heap
- 1 November 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (6) , 1012-1027
- https://doi.org/10.1145/355541.355554
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A minimum spanning tree algorithm with inverse-Ackermann type complexityJournal of the ACM, 2000
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- A data structure for manipulating priority queuesCommunications of the ACM, 1978
- Time bounds for selectionJournal of Computer and System Sciences, 1973