Skip Navigation

The Computer Journal 1990 33(4):344-355; doi:10.1093/comjnl/33.4.344
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ancona, M.
Right arrow Articles by Deogun, J. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Structured Spanning Trees

M. Ancona1 *, L. De Floriani2 § and J. S. Deogun3 ¶

1 Dipartimento di Matematica, Universita' di Genova, Via L.B. Alberti, 4, 16132 Genova, Italy, 2 Istituto per la Matematica Applicata del C.N.R., Via L.B. Alberti, 4, 16132 Genova, Italy, 3 Department of Computer Science, University of Nebraska, Lincoln, NE 68588-0115, USA

The spanning tree problem in the framework of a hierarchical graph structure, called a structured graph, is considered. A structured graph is a hierarchy of graphs which provides a relational description of an entity at different levels of abstraction. The concept of structured graph is briefly reviewed and some of its properties are presented. The concept of structured spanning tree is defined and its relationship with ‘canonical’ spanning trees is investigated. An algorithm is presented for computing a structured spanning tree of a graph from its canonical spanning tree. An algorithm for finding a minimum-cost canonical spanning tree of a graph by operating on its structured graph representation is developed. The study of structured spanning trees is motivated by their application to hierarchical design and processing of VLSI circuits and communication networks.

Received January 1987. revised March 1988.

* Dipartimento di Matematica, Universita' di Genova, Via L.B. Alberti, 4, 16132 Genova, Italy

§ Istituto per la Matematica Applicata del C.N.R., Via L.B. Alberti, 4, 16132 Genova, Italy

Department of Computer Science, University of Nebraska, Lincoln, NE 68588-0115, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.