Cliques, Coloring and Satisfiability
American Mathematical Society (Publisher)
Published in November 1996
Book
Hardback
657 pages
978-0-8218-6609-2 (ISBN)
Article exhausted; check different version
Description
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.
More details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
Illustrations
Illustrations
Dimensions
Height: 230 mm
Weight
1364 gr
ISBN-13
978-0-8218-6609-2 (9780821866092)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification