Author:
Haralambides J.,Makedon F.,Monien B.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. C. H. Papadimitriou, The NP-completeness of the bandwidth minimization problem,Computing,16 (1976), 263–270.
2. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
3. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, Complexity results for bandwidth minimization,SIAM J. Appl. Math.,34 (1978), 477–495.
4. J. B. Saxe, Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time,SIAM J. Algebraic Discrete Methods (1980).
5. E. M. Gurari and I. H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problems,J. Algorithms,5 (1984), 531–546.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献