Optimal layout of edge-weighted forests

DOI10.1016/S0166-218X(98)00088-2zbMath0916.90258OpenAlexW2136039953WikidataQ127190514 ScholiaQ127190514MaRDI QIDQ1276965

Michael J. Fischer, Michael S. Paterson

Publication date: 6 July 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00088-2

zbMATH Keywords

layout problemtrees with weighted edgesvery-large-scale integrated circuits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Time bounds for selection
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Planar Formulae and Their Uses

This page was built for publication: Optimal layout of edge-weighted forests