Are Fibonacci heaps optimal?

DOI10.1007/3-540-58325-4_210MaRDI QIDQ4525734zbMATH OpenFDO

Authors Diab Abuaiadh, Jeffrey H. Kingston

Publication date 24 January 2001

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

Full work available at URL https://doi.org/10.1007/3-540-58325-4_210

Mathematics Subject Classification ID

Data structures (68P05)

Cited in

(5)

• Shortest path algorithms for nearly acyclic directed graphs
• Improved shortest path algorithms for nearly acyclic graphs
• Partial Solution and Entropy
• Shortest path algorithms for nearly acyclic directed graphs
• Solving shortest paths efficiently on nearly acyclic directed graphs

This page was built for publication: Are Fibonacci heaps optimal?

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