Theory of 2 - 3 heaps
| dc.contributor.author | Takaoka, Tadao | |
| dc.date.accessioned | 2017-12-05T02:50:52Z | |
| dc.date.available | 2017-12-05T02:50:52Z | |
| dc.date.issued | 2002 | en |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/14769 | |
| dc.identifier.uri | http://dx.doi.org/10.26021/1255 | |
| dc.language | English | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury | en |
| dc.rights | All Right Reserved | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | en |
| dc.title | Theory of 2 - 3 heaps | en |
| dc.type | Theses / Dissertations | en |
| thesis.degree.grantor | University of Canterbury | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Other | en |
| uc.college | Faculty of Engineering | en |