Skip to main content
SpringerLink
Log in

The NP-Completeness of the bandwidth minimization problem

Die NP-Geschlossenheit des Problems der minimalen Bandbreite

  • Published:
Computing Aims and scope Submit manuscript

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.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cuthill, E., McKee, J.: Reducing the Bandwidth of Sparse Symmetric Matrices. Proc. 24-th Nat. Conf. ACM, pp. 157–172 (1969).

  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.

  3. Tewarson, R. P.: Sparse Matrices. Chapter 3.8. Academic Press 1973.

  4. Chen, K. Y.: Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing11, 103–110 (1973).

    Google Scholar 

  5. Chen, K. Y.: Note on Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing11, 27–30 (1973).

    Google Scholar 

  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.

  7. Karp, R. M.: Reducibility among Combinatorial Problems, in: Complexity of Computer Computations (Miller, R., Thatcher, J., eds.). Plenum Press 1972.

  8. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974.

  9. Sahni, S., Gonzalez, T.: P-Complete Problems and Approximate Solutions. Proc. 15th SWAT Symposium, 1974.

  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).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Princeton University, 08540, Princeton, NJ, USA

    Ch. H. Papadimitriou

Authors
  1. Ch. H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by NSF Grant GK-42048 and the U.S. Army Research Office — Durham under Contract DAHC04-69-C0012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papadimitriou, C.H. The NP-Completeness of the bandwidth minimization problem. Computing 16, 263–270 (1976). https://doi.org/10.1007/BF02280884

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02280884

Keywords

Search

Navigation