Cliques, coloring, and satisfiability : second DIMACS implementation challenge, October 11-13, 1993
著者
書誌事項
Cliques, coloring, and satisfiability : second DIMACS implementation challenge, October 11-13, 1993
（DIMACS series in discrete mathematics and theoretical computer science, v. 26）
American Mathematical Society, c1996
大学図書館所蔵 全20件
注記
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT&T Bell Labs, Bellcore."
Includes bibliographical references
内容説明・目次
内容説明
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.
「Nielsen BookData」 より