论文信息 - Efficient Algorithms for Listing Unlabeled Graphs - 字舞流文

Efficient Algorithms for Listing Unlabeled Graphs

Leslie Ann Goldberg

[1] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[2] Ronald C. Read,et al. A survey of graph generation techniques , 1981 .

[3] Christoph M. Hoffmann,et al. Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.

[4] László Babai,et al. Canonical labeling of graphs , 1983, STOC.

[5] Mihalis Yannakakis,et al. On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[6] John E. Hopcroft,et al. Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7] Nicholas C. Wormald,et al. Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..

[8] Charles J. Colbourn,et al. Orderly algorithms for generating restricted classes of graphs , 1979, J. Graph Theory.

[9] Charles J. Colbourn,et al. Orderly algorithms for graph generation , 1979 .

[10] Herbert S. Wilf,et al. The Random Selection of Unlabeled Graphs , 1983, J. Algorithms.

[11] Béla Bollobás,et al. Random Graphs , 1985 .