Generating lower bounds for the linear arrangement problem
Authors:
- Weiguo LiuWLWeiguo Liu
- Anthony VannelliAVAnthony Vannelli
- 1 May 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 59 (2) , 137-151
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Near-optimal quadratic-based placement for a class of IC layout problemsIEEE Circuits and Devices Magazine, 1985
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- One-dimensional logic gate assignment and interval graphsIEEE Transactions on Circuits and Systems, 1979
- A Minimum Linear Arrangement Algorithm for Undirected TreesSIAM Journal on Computing, 1979
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970