A CYCLE GENERATION ALGORITHM FOR FINITE UNDIRECTED LINEAR GRAPHS

被引:46
作者
GIBBS, NE
机构
[1] Computer Science Center, College of William and Mary, Purdue University, Department of Computer Science, West Lafayette, Indiana
关键词
D O I
10.1145/321541.321545
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
When the algorithms of J. T. Welch, Jr. were implemented it was discovered that they did not perform as described. The generation of all cycles from a basis is faulty. The generation of the basis is apparently correct. A modified version of Welch's Algorithm 3 is presented. The reasons for modifying Welch's algorithms are presented with examples. © 1969, ACM. All rights reserved.
引用
收藏
页码:564 / &
相关论文
共 6 条
[1]  
BERGE C, 1962, THEORY GRAPHS APPLIC
[2]   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-&
[3]   A MECHANICAL ANALYSIS OF CYCLIC STRUCTURE OF UNDIRECTED LINEAR GRAPHS [J].
WELCH, JT .
JOURNAL OF THE ACM, 1966, 13 (02) :205-&
[4]  
WELCH JT, 1965 P ACM NAT C, P296
[5]  
WHITNEY H, 1935, AMER J MATH, V57, P530
[6]  
[No title captured]