Skip to main content
SpringerLink
Log in

Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region

  • Contibuted Papers
  • Conference paper
  • First Online:
STACS 84 (STACS 1984)

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

Included in the following conference series:

  • 107 Accesses

Abstract

The lower bound for the minimal bisection width of the tree of meshes with respect to all vertices (w.r.t. all leaves) is determined in both cases. On the basis of these results the lower bounds of layout area with all vertices (leaves) on the perimeter of the bounding convex region, which coincide with upper bounds, are stated.

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. Brent, R.P., Kung, H.T.: On the area of binary tree layouts. Information Processing Letters, 11, 1980, pp. 44–46.

    Google Scholar 

  2. Leiserson, C.E.: Area — efficient graph layouts (for VLSI). Proc. of the 21-st Annual IEEE Symp. on Found. of CS, Oct. 1980, pp. 270–281.

    Google Scholar 

  3. Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transactions on Computers, Vol. C-30, No. 2, Feb. 1981, pp. 135–140.

    Google Scholar 

  4. Leighton, F.T.: New lower bound techniques for VLSI. Proc. of the 22-nd Annual IEEE Symp. on Found. of CS, 1981, pp. 1–12.

    Google Scholar 

  5. Thompson, C.D.: A complexity theory for VLSI. CMU-CS-80-140, Carnegie — Mellon University, 1980.

    Google Scholar 

  6. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified polynomial complete problems. SIGACT, 1974, pp. 47–63.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Technical Cybernetics, Slovak Academy of Sciences, Dúbravská cesta 9, 842 37, Bratislava, Czechoslovakia

    O. Sýkora & I. Vrto

Authors
  1. O. Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Vrto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sýkora, O., Vrto, I. (1984). Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12920-2

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation