Skip to main content
SpringerLink
Log in

The bandwidth of planar distributive lattices

  • Complexity Issues
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1986)

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

Included in the following conference series:

  • 156 Accesses

Abstract

The ordered bandwidth problem for finite tight suborders P of IN2 with (0,0)∃P and hence, in particular, for planar distributive lattices is considered. The following sharp bounds in terms of the width are derived for such orders:

$$w\left( P \right) \leqslant bw\left( P \right) \leqslant w\left( P \right) + 1$$

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

  • J. Chvátalová [1975]: Optimal labelling of a product of two paths. Discr. Math. 11 (1975), 249–253.

    Google Scholar 

  • A. Frank [1986]: personal communication.

    Google Scholar 

  • M.R. Garey, R.L. Graham, D.S. Johnson, and D.E. Knuth [1978]: Complexity results for bandwidth minimization. SIAM Journ. Appl. Math. 34 (1978), 477–495.

    Google Scholar 

  • L. Harper [1966]: Optimal numberings and the isoperimetric problem on graphs. Journ. Comb. Th. 1 (1966), 385–393.

    Google Scholar 

  • H.S. Moghadam [1983]: Compression operators and a solution of the bandwidth problem of the product on n paths. Doctoral Dissertation, University of California at Riverside.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bonn

    Ulrich Faigle

  2. Riverside, USA

    Gerhard Gierz

Authors
  1. Ulrich Faigle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Gierz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Tinhofer Gunther Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faigle, U., Gierz, G. (1987). The bandwidth of planar distributive lattices. In: Tinhofer, G., Schmidt, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1986. Lecture Notes in Computer Science, vol 246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17218-1_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-17218-1_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17218-5

  • Online ISBN: 978-3-540-47415-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation