Non-Fiction Books:

Efficient Algorithms for Listing Combinatorial Structures

Customer rating

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Share this product

Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg
$100.99
In stock with supplier

The item is brand new and in-stock in with one of our preferred suppliers. The item will ship from the Mighty Ape warehouse within the timeframe shown below.

Usually ships within 2-3 weeks

Availability

Delivering to:

Estimated arrival:

  • Around 19-25 October using standard courier delivery

Description

First 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 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.
Release date NZ
July 30th, 2009
Imprint
Cambridge University Press
Pages
180
Dimensions
170x244x10
ISBN-13
9780521117883
Product ID
3169472

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

  • If you think we've made a mistake or omitted details, please send us your feedback. Send Feedback
  • If you have a question or problem with this product, visit our Help section. Get Help
  • Seen a lower price for this product elsewhere? We'll do our best to beat it. Request a better price
Filed under...

Buy this and earn 471 Banana Points