PATH PROBLEMS IN STRUCTURED GRAPHS

被引：8

作者：

ANCONA, M ^{[1
]}

DEFLORIANI, L ^{[1
]}

DEOGUN, JS ^{[1
]}

机构：

[1] UNIV NEBRASKA,DEPT COMP SCI,LINCOLN,NE 68588

来源：

COMPUTER JOURNAL | 1986年 / 29卷 / 06期

关键词：

COMPUTER PROGRAMMING - Algorithms;

D O I：

10.1093/comjnl/29.6.553

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：553 / 563

页数：11

共 16 条

[1]

Ancona M., 1982, Operations Research Letters, V1, P170, DOI 10.1016/0167-6377(82)90034-7

[2]

Ancona M., 1984, Rivista di Informatica, V14, P361

[3]

ANCONA M, 1984, 158 I MAT APPL CNR T

[4]

ANCONA M, 1982, 2ND P APPL SIM S PAR, P155

[5]

HAGOUEL J, 1983, P MELECON 83 ATHENS

[6]

Harada M., 1979, Proceedings of COMPSAC the IEEE Computer Society's Third International Computer Software and Applications Conference, P367

[7]

Harary Frank, 1977, GRAPH THEORY

[8]

IIZAWE A, 1981, 8120 U TOK DEP INF S

[9]

KAERKES K, 1977, METHODS OPERATIONS R, V27, P1

[10]

Mead C., 1980, INTRO VLSI SYSTEMS

← 1 2 →