### Abstract

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 structured paths and to compute a structured path from a given canonical one are presented.

Original language | English (US) |
---|---|

Pages (from-to) | 553-563 |

Number of pages | 11 |

Journal | Computer Journal |

Volume | 30 |

Issue number | 6 |

State | Published - Dec 1 1986 |

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Computer Journal*,

*30*(6), 553-563.

**PATH PROBLEMS IN STRUCTURED GRAPHS.** / Ancona, M.; De Floriani, L.; Deogun, J. S.

Research output: Contribution to journal › Article

*Computer Journal*, vol. 30, no. 6, pp. 553-563.

}

TY - JOUR

T1 - PATH PROBLEMS IN STRUCTURED GRAPHS.

AU - Ancona, M.

AU - De Floriani, L.

AU - Deogun, J. S.

PY - 1986/12/1

Y1 - 1986/12/1

N2 - 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 structured paths and to compute a structured path from a given canonical one are presented.

AB - 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 structured paths and to compute a structured path from a given canonical one are presented.

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

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

M3 - Article

AN - SCOPUS:0022985649

VL - 30

SP - 553

EP - 563

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 6

ER -