Skip to main content
SpringerLink
Log in

Theory of Trinomial Heaps

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

Abstract

We design a new data structure, called a trinomial heap, which supports a decrease-key in O(1) time, and an insert operation and delete-min operation in O(logn) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math. 1 1959 269–271.

    Article  MATH  MathSciNet  Google Scholar 

  2. Driscoll, J.R., H.N. Gabow, R. Shrairman, and R.E. Tarjan, An alternative to Fibonacci heaps with application to parallel computation, Comm. ACM, 31(11) 1988 1343–1345.

    Article  MathSciNet  Google Scholar 

  3. Fredman, M.L. and R.E. Tarjan, Fibonacci heaps and their uses in inproved network optimization algorithms, Jour. ACM 34 1987 596–615

    Google Scholar 

  4. Prim, R.C., Shortest connection networks and some generalizations, Bell Sys. Tech. Jour. 36 1957 1389–1401.

    Google Scholar 

  5. Takaoka, T., Theory of 2-3 Heaps, COCOON 99, Lecture Notes of Computer Science 1999 41–50

    Google Scholar 

  6. Vuillemin, J., A data structure for manipulating priority queues, Comm. ACM 21 1978 309–314.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Canterbury, Christchurch, New Zealand

    Tadao Takaoka

Authors
  1. Tadao Takaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takaoka, T. (2000). Theory of Trinomial Heaps. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation