Efficient algorithms for listing combinatorial structures

This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial structures, How can these be applied to those families that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Polya's cycle polynomial is demonstrated.

[1]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[2]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[3]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[4]  Leslie Ann Goldberg.  Efficient Algorithms for Listing Unlabeled Graphs , 1992, J. Algorithms.

[5]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[6]  Leslie Ann Goldberg,et al.  Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial , 1993, Inf. Comput..

[7]  Walter Oberschelp.  Fast parallel algorithms for finding all prime implicants for discrete functions , 1983, Logic and Machines.

[8]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[9]  Frank Harary,et al.  Properties of almost all graphs and complexes , 1979, J. Graph Theory.

[10]  Alan M. Frieze,et al.  An algorithm for finding Hamilton cycles in random graphs , 1985, STOC '85.

[11]  Edgar M. Palmer.  Asymptotic formulas for the number of self-complementary graphs and digraphs , 1970 .

[12]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[13]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[14]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[15]  Bezem,et al.  Enumeration in graphs , 1987 .

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

[17]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[18]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[19]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[20]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[21]  Anna Lubiw,et al.  Some NP-Complete Problems Similar to Graph Isomorphism , 1981, SIAM J. Comput..

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

[23]  Andrzej Ruciński.  Induced Subgraphs in a Random Graph , 1987 .

[24]  de Ng Dick Bruijn.  Pólya's theory of counting , 1964 .

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

[26]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[27]  Richard H. Schelp,et al.  Neighborhood unions and hamiltonian properties in graphs , 1989, J. Comb. Theory, Ser. B.

[28]  J. Hartmanis,et al.  Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..

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

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

[31]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[32]  László Babai,et al.  Canonical labelling of graphs in linear average time , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[33]  A. Sinclair.  Randomised algorithms for counting and generating combinatorial structures , 1988 .

[34]  Frank Ruskey,et al.  Generating Binary Trees Lexicographically , 1977, SIAM J. Comput..

[35]  Keith Edwards,et al.  The Complexity of Colouring Problems on Dense Graphs , 1986, Theor. Comput. Sci..

[36]  Shuji Tsukiyama,et al.  An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.

[37]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[38]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[39]  Colin McDiarmid,et al.  Topics in Chromatic Graph Theory: Colouring random graphs , 2015 .

[40]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[41]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[42]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[43]  Ludek Kucera.  Graphs with Small Chromatic Numbers are Easy to Color , 1989, Inf. Process. Lett..

[44]  de Ng Dick Bruijn.  Enumerative combinatorial problems concerning structures , 1963 .

[45]  Mark Jerrum.  A Compact Representation for Permutation Groups , 1982, FOCS.

[46]  Sandra Mitchell Hedetniemi,et al.  Constant Time Generation of Rooted Trees , 1980, SIAM J. Comput..

[47]  E. M. Wright.  Counting coloured graphs , 1961 .

[48]  Claus-Peter Schnorr,et al.  Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.