Optimal layout of edge-weighted forests

DOI10.1016/S0166-218X(98)00088-2MaRDI QIDQ1276965zbMATH OpenOpenAlexWikidataFDO

Authors Michael 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)

Recommendations

• On the Optimal Layout of Planar Graphs with Fixed Boundary
• On optimal linear arrangements of trees
• Optimal weight allocation in rooted trees
• Linear arrangement problems on recursively partitioned graphs
• On the maximum edge length in VLSI layouts of complete binary trees

Cites work

• scientific article; zbMATH DE number 3782398 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Planar Formulae and Their Uses
• Time bounds for selection

Cited in

(9)

• Layouts with wires of balanced length
• Optimal weight allocation in rooted trees
• scientific article; zbMATH DE number 3906407 (Why is no real title available?)
• Resource allocation in rooted trees for VLSI applications
• Skew minimization problem with possible sink displacement
• scientific article; zbMATH DE number 933178 (Why is no real title available?)
• On central placements of new vertices in a planar point set
• scientific article; zbMATH DE number 3910313 (Why is no real title available?)
• On the Optimal Layout of Planar Graphs with Fixed Boundary

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

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