Skip to main content
SpringerLink
Log in

Bandwidth and profile minimization

  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 344))

Included in the following conference series:

Abstract

For a class of bandwidth approximation algorithms (called level algorithms), we show that the ratio of the approximation and the exact bandwidth is Ω(log bw(G)-1(n)). Then we give a general approximation algorithm which tries to improve a given layout. It is based on a reordering of a previously generated layout. To generate initial layouts two further level algorithms are introduced.

To compare such algorithms we define two norms for the quality of bandwidth approximation algorithms. The first is influenced by a bound which is inherently given for all level algorithms. The second is influenced by a lower bound for the bandwidth. We have tested the improvement algorithm on many graphs and it provides substantial better bandwidth approximation than all level algorithms.

The bandwidth improvement algorithm is also used for minimizing the profile of a graph. We give a list of results obtained by our algorithm for 30 examples given by G. C. Everstine. So our algorithms becomes comparable with other algorithms which have used these examples as a test set.

This research was supported by a grant from the German Research Association (DFG)

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. F. Assmann, G. W. Peck, M. M. Syslo, and J. Zak. The bandwidth of catterpilars with hairs of length 1 and 2. SIAM J. Algebraic and Discret Methodes, 2:387–393, 1981.

    Google Scholar 

  2. P. Z. Chinn, J. Chvátalová, A. K. Dewedney, and N. E. Gibbs. The bandwidth problem for graphs and matrices — a survey. Journal of Graph Theory, 6:223–254, 1982.

    Google Scholar 

  3. E. Cuthill and J. Mckee. Reducing the bandwidth of matrices. In Proc. 24th Nat. Conf. ACM, pages 157–166, 1969.

    Google Scholar 

  4. S. Even. Graph Algorithms. Computer Science Press, Inc., 1979.

    Google Scholar 

  5. G. C. Everstine. A comparision of three resequencing algorithm for the reduction of matrix profile and wavefront. International journal for numerical methods in engineering, 14:837–853, 1979.

    Google Scholar 

  6. G. C. Everstine. Bandwidth test results. Personal communication, 1988.

    Google Scholar 

  7. N. E. Gibbs, W. G. Pool Jr., and P. K. Stockmeyer. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numerical Analysis, 13:236–250, 1976.

    Google Scholar 

  8. E. T. Gurari and I. H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. Journal of Algorithms, 5:531–546, 1984.

    Google Scholar 

  9. E. O. Hare, W. R. Hare, and S. T. Hendetniemi. Another upper bound for the bandwidths of trees. Congressus Numerantium 50, 77–83, 1985.

    Google Scholar 

  10. D. Kratsch. Finding the Minimum Bandwidth of an Interval Graph. Manuskript N/86/18, Friedrich-Schiller-Universität Jena, 1986.

    Google Scholar 

  11. R. Levy. Resequencing of the structural stiffness matrix to improve computational efficiency. Jet Propulsion Laboratory Quart. Tech. Review, 1:61–70, 1971.

    Google Scholar 

  12. W.-H. Liu and A. H. Sherman. Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices. SIAM J. Numerical Analysis, 13:198–213, 1976.

    Google Scholar 

  13. K. Mehlhorn. Data Structures and Algorithms. Volume 1, Sorting and Searching, EATCS Monographs on Theoretical Computer Sience, 1984.

    Google Scholar 

  14. B. Monien. The bandwidth — minimization problem for caterpillars with hair length 3 is NP-Complete. SIAM J. Algebraic and Discret Methodes, 7:505–512, 1986.

    Google Scholar 

  15. C. H. Papadimitriou. The NP-Completeness of the bandwidth minimization problem. Computing, 16:263–270, 1976.

    Google Scholar 

  16. J. B. Saxe. Dynamic programming algorithms for recognizing small bandwidth graphs in polynominal time. SIAM J. Algebraic and Discret Methodes, 363–369, 1980.

    Google Scholar 

  17. J. S. Turner. On the probable performance of heuristics for bandwidth minimization. SIAM J. Computing, 15:561–580, 1986.

    Google Scholar 

  18. M. Wiegers. Computing Lower Bounds of the Bandwidth. Manuscript, Universität GH Paderborn, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität GH Paderborn, FB 17, Warburger Str. 100, D-4790, Paderborn, FRG

    Manfred Wiegers & Burkhard Monien

Authors
  1. Manfred Wiegers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wiegers, M., Monien, B. (1989). Bandwidth and profile minimization. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-50728-0_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50728-4

  • Online ISBN: 978-3-540-46076-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation