An intermediate-value theorem for optimum tree valuation

DOI10.1016/0020-0190(79)90006-1zbMath0397.68064OpenAlexW1979010287MaRDI QIDQ1253929

Sukhamay Kundu

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90006-1

zbMATH Keywords

Binary TreesIntermediate- Value PropertyOptimal LabelingOptimum Tree Valuation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• On the graceful numbering of spanning trees
• Some simplified NP-complete graph problems
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Optimal Linear Ordering
• A Review of the Placement and Quadratic Assignment Problems

This page was built for publication: An intermediate-value theorem for optimum tree valuation