SOME HAMILTON PATHS AND A MINIMAL CHANGE ALGORITHM

被引:35
作者
EADES, P [1 ]
HICKEY, M [1 ]
READ, RC [1 ]
机构
[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA
关键词
D O I
10.1145/2422.322413
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
MATHEMATICAL TECHNIQUES
引用
收藏
页码:19 / 29
页数:11
相关论文
共 6 条
[1]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[2]   LOOPLESS ALGORITHMS FOR GENERATING PERMUTATIONS, COMBINATIONS, AND OTHER COMBINATORIAL CONFIGURATIONS [J].
EHRLICH, G .
JOURNAL OF THE ACM, 1973, 20 (03) :500-513
[3]   GRAY CODES IN GRAPHS OF SUBSETS [J].
JOICHI, JT ;
WHITE, DE .
DISCRETE MATHEMATICS, 1980, 31 (01) :29-41
[4]   3 NEW COMBINATION ALGORITHMS WITH THE MINIMAL CHANGE PROPERTY [J].
LAM, CWH ;
SOICHER, LH .
COMMUNICATIONS OF THE ACM, 1982, 25 (08) :555-559
[5]  
Nijenhuis A., 1978, COMBINATORIAL ALGORI
[6]  
Reingold E. M., 1977, COMBINATORIAL ALGORI