Theory of Trinomial Heaps
| dc.contributor.author | Takaoka, Tadao | |
| dc.date.accessioned | 2017-12-05T02:50:44Z | |
| dc.date.available | 2017-12-05T02:50:44Z | |
| dc.date.issued | 2002 | en |
| dc.description.abstract | We design a new data structure, called a trinomial heap, which supports the decrease-key in O(1) time, and an insert operation and delete-min operation in O(log n) time, both in the worst case, where n is the size of the heap. The merit of the trinomial heap is that it is conceptually simpler and easier to implement than the previously invented relaxed heap. The relaxed heap is based on binary linking, while the trinomial heap is based on ternary linking. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/14768 | |
| dc.identifier.uri | http://dx.doi.org/10.26021/3221 | |
| 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 Trinomial 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 |