On the Cutwidth and the Topological Bandwidth of a Tree

This publication has 6 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Topological Bandwidth
  SIAM Journal on Algebraic Discrete Methods, 1985
• Polynomial time algorithms for the MIN CUT problem on degree restricted trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• The bandwidth problem for graphs and matrices—a survey
  Journal of Graph Theory, 1982
• Complexity Results for Bandwidth Minimization
  SIAM Journal on Applied Mathematics, 1978
• The NP-Completeness of the bandwidth minimization problem
  Computing, 1976