FAST ALGORITHM FOR RING PERCEPTION

被引：8

作者：

MATYSKA, L

机构：

来源：

JOURNAL OF COMPUTATIONAL CHEMISTRY | 1988年 / 9卷 / 05期

关键词：

D O I：

10.1002/jcc.540090503

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

引用

页码：455 / 459

页数：5

共 20 条

[1]

[Anonymous], 1983, CHEM GRAPH THEORY

[2]

Balaban A.T., 1976, Chemical Applications of Graph Theory, P63

[3] COMPUTER-PROGRAM FOR FINDING ALL POSSIBLE CYCLES IN GRAPHS [J].

BALABAN, AT ;

FILIP, P ;

BALABAN, TS .

JOURNAL OF COMPUTATIONAL CHEMISTRY, 1985, 6 (04) :316-329

[4]

BLAIR J, 1974, COMPUTER REPRESENTAT

[5] ALGORITHM FOR MACHINE PERCEPTION OF SYNTHETICALLY SIGNIFICANT RINGS IN COMPLEX CYCLIC ORGANIC STRUCTURES [J].

COREY, EJ ;

PETERSSO.GA .

JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1972, 94 (02) :460-&

[6] EFFECT OF TAXONOMY CLASS AND SPANNING SET ON IDENTIFYING AND COUNTING RINGS IN A COMPOUND [J].

ELK, SB .

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1985, 25 (01) :11-16

[7] ALGORITHM FOR THE PERCEPTION OF SYNTHETICALLY IMPORTANT RINGS [J].

GASTEIGER, J ;

JOCHUM, C .

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1979, 19 (01) :43-48

[8] A CYCLE GENERATION ALGORITHM FOR FINITE UNDIRECTED LINEAR GRAPHS [J].

GIBBS, NE .

JOURNAL OF THE ACM, 1969, 16 (04) :564-&

[9] ALGORITHMS FOR FINDING A FUNDAMENTAL SET OF CYCLES FOR AN UNDIRECTED LINEAR GRAPH [J].

GOTLIEB, CC ;

CORNEIL, DG .

COMMUNICATIONS OF THE ACM, 1967, 10 (12) :780-&

[10]

Harary Frank, 1969, Graph Theory

← 1 2 →