A variation on the min cut linear arrangement problem
- 1 December 1987
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 20 (1) , 235-252
- https://doi.org/10.1007/bf01692067
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Optimal simulations of tree machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983
- Graphs That are Almost Binary TreesSIAM Journal on Computing, 1982
- The complexity of searching a graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- A dense gate matrix layout method for MOS VLSIIEEE Transactions on Electron Devices, 1980
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973