Share
Efficient Algorithms for Listing Combinatorial Structures Paperback (Distinguished Dissertations in Computer Science) (in English)
Goldberg (Author)
·
Cambridge University Press
· Paperback
Efficient Algorithms for Listing Combinatorial Structures Paperback (Distinguished Dissertations in Computer Science) (in English) - Goldberg
$ 42.04
$ 46.99
You save: $ 4.95
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Monday, June 10 and
Tuesday, June 11.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Efficient Algorithms for Listing Combinatorial Structures Paperback (Distinguished Dissertations in Computer Science) (in English)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.