 |
|
|
Item Details
| Title:
|
CLIQUES, COLORING AND SATISFIABILITY
|
| By: |
David S. Johnson (Editor), Michael Trick (Editor) |
| Format: |
Hardback |
| List price:
|
£74.75 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0821866095 |
| ISBN 13: |
9780821866092 |
| Publisher: |
AMERICAN MATHEMATICAL SOCIETY |
| Pub. date: |
21 November, 1996 |
| Series: |
Series in Discrete Mathematics & Theoretical Computer Science No.26 |
| Pages: |
657 |
| Description: |
The purpose of a DIMACS Challenge is to encourage research in the analysis of algorithms. The Second DIMACS Challenge, on which this volume is based, addresses three difficult combinatorial optimization problems. |
| Synopsis: |
The purpose of a DIMACS Challenge is to encourage and coordinate research in the experimental analysis of algorithms. The First DIMACS Challenge encouraged experimental work in the area of network flow and matchings. This Second DIMACS Challenge, on which this volume is based, took place in conjunction with the DIMACS Special Year on Combinatorial Optimization. Addressed here are three difficult combinatorial optimization problems: finding cliques in a graph, colouring the vertices of a graph, and solving instances of the satisfiability problem. These problems were chosen both for their practical interest and because of their theoretical intractability. |
| Illustrations: |
Illustrations |
| Publication: |
US |
| Imprint: |
American Mathematical Society |
| Returns: |
Non-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...
|
|
|
|
|