Computing

, Volume 16, Issue 3, pp 263–270 | Cite as

The NP-Completeness of the bandwidth minimization problem

  • Ch. H. Papadimitriou
Article

Abstract

The Problem of minimizing the bandwidth of the nonzero entries of a sparse symmetric matrix by permuting its rows and columns and some related combinatorial problems are shown to be NP-Complete.

Die NP-Geschlossenheit des Problems der minimalen Bandbreite

Zusammenfassung

Es wird gezeigt, daß das Problem, die minimale Bandbreite der von Null verschiedenen Elemente einer schwach besetzten symmetrischen Matrix durch Umstellung der Reihen und Spalten zu finden, und einige verwandte Probleme der Kombinatorik NP-geschlossene sind.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cuthill, E., McKee, J.: Reducing the Bandwidth of Sparse Symmetric Matrices. Proc. 24-th Nat. Conf. ACM, pp. 157–172 (1969).Google Scholar
  2. [2]
    Cuthill, E.: Several Strategies for Reducing the Bandwidth of Matrices, in: Sparse Matrices and their Applications (Rose, D., Willoughby, R., eds.). Plenum Press 1972.Google Scholar
  3. [3]
    Tewarson, R. P.: Sparse Matrices. Chapter 3.8. Academic Press 1973.Google Scholar
  4. [4]
    Chen, K. Y.: Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing11, 103–110 (1973).Google Scholar
  5. [5]
    Chen, K. Y.: Note on Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing11, 27–30 (1973).Google Scholar
  6. [6]
    Harary, F.: Sparse Matrices in Graph Theory, in: Large Sparse Sets of Linear Equations (Reidl, J. K., ed.), pp. 139–150. Academic Press 1970.Google Scholar
  7. [7]
    Karp, R. M.: Reducibility among Combinatorial Problems, in: Complexity of Computer Computations (Miller, R., Thatcher, J., eds.). Plenum Press 1972.Google Scholar
  8. [8]
    Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974.Google Scholar
  9. [9]
    Sahni, S., Gonzalez, T.: P-Complete Problems and Approximate Solutions. Proc. 15th SWAT Symposium, 1974.Google Scholar
  10. [10]
    Garey, M. R., Johnson, D. S., Stockmeyer, L.: Some Simplified NP-Complete Problems. Proc. 6th Annual ACM Symposium on Theory of Computing, pp. 47–63 (1974).Google Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • Ch. H. Papadimitriou
    • 1
  1. 1.Department of Electrical EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations