Efficient Algorithms for Listing Combinatorial Structures by ... - 9780521117883

Efficient Algorithms for Listing Combinatorial StructuresAuthor(s): Leslie Ann Goldberg\nFormat: Paperback\nPublisher: Cambridge University Press, United Kingdom\nImprint: Cambridge University Press\nISBN-13: 9780521117883, 978-0521117883\nSynopsis\nFirst published in 1993, 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 which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the di.