Skip Navigation

The Computer Journal 1986 29(6):553-563; doi:10.1093/comjnl/29.6.553
© 1986 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 arrow Search for citing articles in:
ISI Web of Science (6)
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?

Path Problems in Structured Graphs

M. Ancona1 *, L. De Floriani1 * and J. S. Deogun §

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

A structured graph is a hierarchy of graphs which provides a representation of a graph at variable detail levels. In this paper we investigate the path problem in a structured graph. The concept of structured graph is defined, and a formal definition of path in such a structure is given. The relationship between structured paths and canonical ones in the graph represented by a structured graph is investigated. Algorithms to construct paths and to compute a structured path from a given canonical one are presented.

Received December 1984.

* 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, U.S.A.


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.