Abstract
As an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, which supports n insert, n delete-min, and m decrease-key operations in O(m+n log n) time. Our experiments show the 2–3 heap is more efficient. The new data structure will have a wide application in graph algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
