ORDERLY ALGORITHMS FOR GRAPH GENERATION

被引：19

作者：

COLBOURN, CJ ^{[1
]}

READ, RC ^{[1
]}

机构：

[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1979年 / 7卷 / 03期

关键词：

Graph; graph generation; locally restricted graph; orderly algorithm;

D O I：

10.1080/00207167908803169

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The existence of orderly analogues of graph generators proposed by Heap and Farrell is established. The modifications to these algorithms supply practical methods enabling one to generate exhaustive lists of graphs and locally restricted graphs; moreover, the difficulty involved in ensuring that no duplications occur in the list is greatly reduced. © 1979, Taylor & Francis Group, LLC. All rights reserved.

引用

页码：167 / 172

页数：6

共 9 条

[1]

COLBOURN CJ, CS7737 U WAT DEP COM

[2]

COLBOURN CJ, 1977, THESIS U WATERLOO

[3] GRAPHICAL PARTITIONS AND PLANARITY [J].

FARRELL, EJ .

DISCRETE MATHEMATICS, 1977, 18 (02) :149-153

[4]

FARRELL EJ, 1971, THESIS U WATERLOO

[5]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[6]

HEAP BR, 1972, GRAPH THEORY COMPUTI, P47

[7] ALGORITHM 28 - ALGORITHM FOR GENERATING GRAPHS OF A GIVEN PARTITION [J].

JAMES, KR ;

RIHA, W .

COMPUTING, 1976, 16 (1-2) :153-161

[8]

READ RT, UNPUBLISHED

[9]

STOCKTON F, 1968, 268 SHELL DEV CO TEC

← 1 →