 |
|
|
Item Details
| Title:
|
EFFICIENT ALGORITHMS FOR LISTING COMBINATORIAL STRUCTURES
|
| By: |
Leslie Ann Goldberg |
| Format: |
Paperback |
| List price:
|
£38.00 |
| Our price: |
£33.25 |
| Discount: |
|
| You save:
|
£4.75 |
|
|
|
|
|
| ISBN 10: |
0521117887 |
| ISBN 13: |
9780521117883 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
14 April, 2009 |
| Series: |
Distinguished Dissertations in Computer Science No. 5 |
| Pages: |
180 |
| Description: |
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. |
| Synopsis: |
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. |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|