Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The cost of a class of optimal binary trees

From MaRDI portal
Publication:1844596
Jump to:navigation, search

DOI10.1016/0097-3165(74)90051-XzbMATH Open0283.90064MaRDI QIDQ1844596FDOQ1844596

Alan C. Tucker

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)






Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)


Cites Work

  • Title not available (Why is that?)
  • A Method for the Construction of Minimum-Redundancy Codes
  • Optimal Computer Search Trees and Variable-Length Alphabetical Codes
  • Optimum binary search trees


Cited In (1)

  • An explicit expression for the cost of a class of Huffman trees





This page was built for publication: The cost of a class of optimal binary trees

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1844596&oldid=14222167"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 10:46. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki