PATH PROBLEMS IN STRUCTURED GRAPHS.

M. Ancona, L. De Floriani, Jitender S Deogun

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)553-563
Number of pages11
JournalComputer Journal
Volume30
Issue number6
StatePublished - Dec 1 1986

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Ancona, M., De Floriani, L., & Deogun, J. S. (1986). PATH PROBLEMS IN STRUCTURED GRAPHS. Computer Journal, 30(6), 553-563.

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

In: Computer Journal, Vol. 30, No. 6, 01.12.1986, p. 553-563.

Research output: Contribution to journalArticle

Ancona, M, De Floriani, L & Deogun, JS 1986, 'PATH PROBLEMS IN STRUCTURED GRAPHS.', Computer Journal, vol. 30, no. 6, pp. 553-563.
Ancona M, De Floriani L, Deogun JS. PATH PROBLEMS IN STRUCTURED GRAPHS. Computer Journal. 1986 Dec 1;30(6):553-563.
Ancona, M. ; De Floriani, L. ; Deogun, Jitender S. / PATH PROBLEMS IN STRUCTURED GRAPHS. In: Computer Journal. 1986 ; Vol. 30, No. 6. pp. 553-563.
@article{e4af260f649844f682cebeafd061e9df,
title = "PATH PROBLEMS IN STRUCTURED GRAPHS.",
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.",
author = "M. Ancona and {De Floriani}, L. and Deogun, {Jitender S}",
year = "1986",
month = "12",
day = "1",
language = "English (US)",
volume = "30",
pages = "553--563",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "6",

}

TY - JOUR

T1 - PATH PROBLEMS IN STRUCTURED GRAPHS.

AU - Ancona, M.

AU - De Floriani, L.

AU - Deogun, Jitender 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

VL - 30

SP - 553

EP - 563

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 6

ER -