Efficient Algorithms for Listing Combinatorial Structures - ISBN:0521450217

Efficient Algorithms for Listing Combinatorial Structures

Date: 21 April 2011, 04:31

Free register and download UseNet downloader, then you can FREE Download from UseNet.

Download without Limit " Efficient Algorithms for Listing Combinatorial Structures " from UseNet for FREE!

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.
• Winner of distinguished dissertation award • Contains material of interest to combinatorialists as well as computer scientists

Download Links:

Download Link (High Speed Download)

Download Link 1 (http://uploading.com/...0521)

Download Link 2 (http://www.filesonic.com/...0)

Download Link 3 (http://www.megaupload.com/...?d=HKGOW2NS)

DISCLAIMER:

This site does not store Efficient Algorithms for Listing Combinatorial Structures on its server. We only index and link to Efficient Algorithms for Listing Combinatorial Structures provided by other sites. Please contact the content providers to delete Efficient Algorithms for Listing Combinatorial Structures if any and email us, we'll remove relevant links or contents immediately.