Complexity Results for Bandwidth Minimization

This publication has 19 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• `` Strong '' NP-Completeness Results
  Journal of the ACM, 1978
• The Complexity of Flowshop and Jobshop Scheduling
  Mathematics of Operations Research, 1976
• Optimal labelling of a product of two paths
  Discrete Mathematics, 1975
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
  SIAM Journal on Computing, 1975
• Tridiagonalization by permutations
  Communications of the ACM, 1974
• Optimal Linear Ordering
  SIAM Journal on Applied Mathematics, 1973
• A remark on a problem of Harary
  Czechoslovak Mathematical Journal, 1970
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965
• An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
  The Computer Journal, 1965