Skip to main content
SpringerLink
Log in
Book cover

Great Lakes CS Conference on New Research Results in Computer Science

Great Lakes CS 1989: Computing in the 90's pp 307–312Cite as

Structured graph models: An efficient tool for VLSI design

  • Track 9: VLSI Design
  • Conference paper
  • First Online:

  • 117 Accesses

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

Abstract

Hierarchical graph models are a powerful tool for describing VLSI circuits. They combine the representation of a hierarchical decomposition of a circuit with a graph description of its topological structure in terms of components and connections. Structured Graphs are an example of such models. In this paper we consider the graph-theoretic problems of spanning trees and Steiner trees in structured graphs. These have connections with the global routing problems in VLSI circuits.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ancona, L. De Floriani. Computational Algorithms for Hierarchically Structured Project Networks, Operations Research Letters, vol. 1, no. 5, 1982.

    Google Scholar 

  2. M. Ancona, L. De Floriani, J.S. Deogun. Path Problems in Structured graphs. The Computer Journal, vol. 29, no. 6, 1986.

    Google Scholar 

  3. M. Ancona, E. Bruzzone, L. De Floriani. The Steiner Problem in structured Graphs. Tech. Rep. I.M.A., 28–88, Genova, 1988.

    Google Scholar 

  4. L. De Floriani, J.S. Deogun. Structured Graphs and Spanning Trees. Proceedings IEEE COMPSAC'83, Chicago, November 1983.

    Google Scholar 

  5. F. Harary. Graph Theory. Addison Wesley, Reading, Mass., 1977.

    Google Scholar 

  6. P. Winter. Steiner Problem in Networks: A Survey. Networks, vol. 17, 1987, pp 129–167.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto per la Matematica Applicata, 16132, Genoa, Italy

    M. Ancona, E. Bruzzone & L. De Floriani

  2. Department of Computer Science, Ball State University, 47306, Muncie, Indiana, USA

    K. S. Bagga

  3. Department of Computer Science, University of Nebraska, 68588, Lincoln, Nebraska, USA

    J. S. Deogun

Authors
  1. M. Ancona
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. S. Bagga
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Bruzzone
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. De Floriani
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. S. Deogun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ancona, M., Bagga, K.S., Bruzzone, E., De Floriani, L., Deogun, J.S. (1991). Structured graph models: An efficient tool for VLSI design. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038508

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation