An intermediate-value theorem for optimum tree valuation

DOI10.1016/0020-0190(79)90006-1MaRDI QIDQ1253929zbMATH OpenOpenAlexFDO

Authors 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

• A Minimum Linear Arrangement Algorithm for Undirected Trees
• A Review of the Placement and Quadratic Assignment Problems
• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• On the graceful numbering of spanning trees
• Optimal Linear Ordering
• Some simplified NP-complete graph problems

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

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