### 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 |

DOIs | |

State | Published - 1986 |

### ASJC Scopus subject areas

- Computer Science(all)

## Cite this

Ancona, M., De Floriani, L., & Deogun, J. S. (1986). PATH PROBLEMS IN STRUCTURED GRAPHS.

*Computer Journal*,*30*(6), 553-563. https://doi.org/10.1093/comjnl/29.6.553