Structured graph models: An efficient tool for VLSI design
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.
Unable to display preview. Download preview PDF.
- M. Ancona, L. De Floriani. Computational Algorithms for Hierarchically Structured Project Networks, Operations Research Letters, vol. 1, no. 5, 1982.Google Scholar
- M. Ancona, L. De Floriani, J.S. Deogun. Path Problems in Structured graphs. The Computer Journal, vol. 29, no. 6, 1986.Google Scholar
- M. Ancona, E. Bruzzone, L. De Floriani. The Steiner Problem in structured Graphs. Tech. Rep. I.M.A., 28–88, Genova, 1988.Google Scholar
- L. De Floriani, J.S. Deogun. Structured Graphs and Spanning Trees. Proceedings IEEE COMPSAC'83, Chicago, November 1983.Google Scholar
- F. Harary. Graph Theory. Addison Wesley, Reading, Mass., 1977.Google Scholar