Structured graph models

An tool for VLSI design efficient

M. Ancona, K. S. Bagga, E. Bruzzone, L. De Floriani, Jitender S Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationComputing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings
EditorsNaveed A. Sherwani, Elise de Doncker, John A. Kapenga
PublisherSpringer Verlag
Pages307-312
Number of pages6
ISBN (Print)9780387976280
DOIs
StatePublished - Jan 1 1991
Event1st Great Lakes Computer Science Conference, 1989 - Kalamazoo, United States
Duration: Oct 18 1989Oct 20 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st Great Lakes Computer Science Conference, 1989
CountryUnited States
CityKalamazoo
Period10/18/8910/20/89

Fingerprint

VLSI Design
VLSI circuits
Graph Model
VLSI Circuits
Graph in graph theory
Decomposition
Steiner Tree
Networks (circuits)
Routing Problem
Topological Structure
Hierarchical Model
Spanning tree
Decompose

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ancona, M., Bagga, K. S., Bruzzone, E., De Floriani, L., & Deogun, J. S. (1991). Structured graph models: An tool for VLSI design efficient. In N. A. Sherwani, E. de Doncker, & J. A. Kapenga (Eds.), Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings (pp. 307-312). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 507 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0038508

Structured graph models : An tool for VLSI design efficient. / Ancona, M.; Bagga, K. S.; Bruzzone, E.; De Floriani, L.; Deogun, Jitender S.

Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. ed. / Naveed A. Sherwani; Elise de Doncker; John A. Kapenga. Springer Verlag, 1991. p. 307-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 507 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ancona, M, Bagga, KS, Bruzzone, E, De Floriani, L & Deogun, JS 1991, Structured graph models: An tool for VLSI design efficient. in NA Sherwani, E de Doncker & JA Kapenga (eds), Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 507 LNCS, Springer Verlag, pp. 307-312, 1st Great Lakes Computer Science Conference, 1989, Kalamazoo, United States, 10/18/89. https://doi.org/10.1007/BFb0038508
Ancona M, Bagga KS, Bruzzone E, De Floriani L, Deogun JS. Structured graph models: An tool for VLSI design efficient. In Sherwani NA, de Doncker E, Kapenga JA, editors, Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. Springer Verlag. 1991. p. 307-312. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0038508
Ancona, M. ; Bagga, K. S. ; Bruzzone, E. ; De Floriani, L. ; Deogun, Jitender S. / Structured graph models : An tool for VLSI design efficient. Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings. editor / Naveed A. Sherwani ; Elise de Doncker ; John A. Kapenga. Springer Verlag, 1991. pp. 307-312 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f48aa765f7ef4e49a5431686789a16b1,
title = "Structured graph models: An tool for VLSI design efficient",
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.",
author = "M. Ancona and Bagga, {K. S.} and E. Bruzzone and {De Floriani}, L. and Deogun, {Jitender S}",
year = "1991",
month = "1",
day = "1",
doi = "10.1007/BFb0038508",
language = "English (US)",
isbn = "9780387976280",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "307--312",
editor = "Sherwani, {Naveed A.} and {de Doncker}, Elise and Kapenga, {John A.}",
booktitle = "Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings",

}

TY - GEN

T1 - Structured graph models

T2 - An tool for VLSI design efficient

AU - Ancona, M.

AU - Bagga, K. S.

AU - Bruzzone, E.

AU - De Floriani, L.

AU - Deogun, Jitender S

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85030862370&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030862370&partnerID=8YFLogxK

U2 - 10.1007/BFb0038508

DO - 10.1007/BFb0038508

M3 - Conference contribution

SN - 9780387976280

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 307

EP - 312

BT - Computing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings

A2 - Sherwani, Naveed A.

A2 - de Doncker, Elise

A2 - Kapenga, John A.

PB - Springer Verlag

ER -