Optimality of gauge and degree-sensitive VLSI layouts of planar graphs

  • Deepak D. Sherlekar
Computer Architecture, Concurrency, Parallelism, Communication And Networking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)


It is known that the layout area of a planar graph is influenced most by input parameters such as the size of its nodes, and its resemblance to an outerplanar graph. The latter is measured by the gauge of the graph. We examine the area-optimality of these layouts by exhibiting gauge and degree sensitive lower bounds on layout area. These results span the spectrum between outerplanar graphs, which have gauge 1, and arbitrary planar graphs, which may have gauge Ω(N), while simultaneously allowing vertices of arbitrarily large degree. In cases where we cannot establish optimality, our bounds place previous results in context by demonstrating gaps between the lower and upper bounds which are sensitive to these parameters. Moreover, we establish matching lower bounds in these cases for corresponding nonplanar graphs having identical partitioning characteristics. Previous gauge and degree sensitive techniques for finding layouts of planar graphs did not consider minimizing the maximum wire length. We address this problem briefly to provide evidence that results similar to layout area can be obtained for this problem as well.


Planar Graph Maximum Degree Outerplanar Graph Arbitrary Degree Layout Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28:300–343, 1984.Google Scholar
  2. [2]
    S. N. Bhatt and C. E. Leiserson. Minimizing the longest edge in a VLSI layout. Technical report, MIT Lab. for Computer Science, 1981.Google Scholar
  3. [3]
    D. Dolev, F. T. Leighton, and H. W. Trickey. Planar embedding of planar graphs. In Advances in Computing Research, vol. 2, pages 147–161. JAI Press, 1984.Google Scholar
  4. [4]
    F. T. Leighton. New lower bound techniques for VLSI. Proc. 22nd Annual Symposium on Foundations of Computer Science, pages 1–12, 1981.Google Scholar
  5. [5]
    C. E. Leiserson. Area Efficient VLSI Computation. PhD thesis, Carnegie Mellon University, 1981.Google Scholar
  6. [6]
    M. S. Paterson, W. L. Ruzzo, and L. Snyder. Bounds on minimax edge length for complete binary trees. Proc. 13th Annual ACM Symposium on Theory of Computing, pages 293–299, 1981.Google Scholar
  7. [7]
    D. D. Sherlekar. Minimizing the maximum wire length in VLSI layouts. Technical report under preparation, June 1990.Google Scholar
  8. [8]
    D. D. Sherlekar and J. JáJá. Input sensitive VLSI layouts of graphs of arbitrary degree. Proceedings of the Third International Agean Worshop on Computing, pages 268–277, June 1988.Google Scholar
  9. [9]
    D. D. Sherlekar and J. JáJá. Layouts of graphs of arbitrary degree. Proceedings of the 25th Annual Allerton Conference, pages 355–364, September 1987.Google Scholar
  10. [10]
    C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, Carnegie Mellon University, 1980.Google Scholar
  11. [11]
    L. G. Valiant. Universality considerations in VLSI circuits. IEEE Transactions on Computers, C-30(2):135–140, Feb 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Deepak D. Sherlekar
    • 1
  1. 1.Department of EECSUniversity of MichiganAnn Arbor

Personalised recommendations