Theory of trinomial heaps

DOI10.1007/3-540-44968-X_36MaRDI QIDQ2766845zbMATH OpenFDO

Authors Tadao Takaoka

Publication date 22 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_36

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Theory of 2-3 heaps
• Pairing heaps with O( n) decrease cost
• M-Heap: A Modified Heap Data Structure
• Hollow Heaps
• Why some heaps support constant-amortized-time decrease-key operations, and others do not

Cited in

(9)

• Improved shortest path algorithms for nearly acyclic graphs
• Theory of 2-3 heaps
• scientific article; zbMATH DE number 4046029 (Why is no real title available?)
• Explaining binomial heaps
• scientific article; zbMATH DE number 1471816 (Why is no real title available?)
• The saga of minimum spanning trees
• Two-Tier Relaxed Heaps
• M-Heap: A Modified Heap Data Structure
• Solving shortest paths efficiently on nearly acyclic directed graphs

This page was built for publication: Theory of trinomial heaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766845)