The.Algorithm.Design.Manual.Springer-Verlag.1998

DIMACS Implementation Challenges
Performance data on both programs is available in files results.dfmax and results.dmclique within the
directories /pub/challenge/graph/benchmarks/clique and /pub/challenge/graph/benchmarks/volume.
Also included in the Second DIMACS Implementation Challenge was satisfiablity. Programs and data
from the challenge are available by anonymous ftp from dimacs.rutgers.edu in the directory
/pub/challenge/sat. In particular, there is random formula generator named mwff.c for constructing hard
satisfiability instances in C by Bart Selman .
The Third DIMACS challenge, held in 1994, focused on parallel algorithms for graphs and game-tree
search.
The Fourth DIMACS challenge, held in 1995, focused on two problems in computational biology;
fragment assembly and sorting with reversals.
The Fifth DIMACS implementation challenge in 1996 will focus on elementary data structures like
dictionaries. The world's best available dictionary implementations are likely to be identified in the
course of the challenge.
● Link to the DIMACS home page
● Challenge 1 - network flow and matching
● Challenge 2 - clique, coloring, and satisfiability
● Challenge 3 - parallel algorithms
● Challenge 4 - computational biology; sequence assembly and genome rearrangements
● Challenge 5 - priority queues, dictionaries, and multi-dimensional point sets.
● Download Files (local site)
Problem Links
● Clique (9)
● Matching (9)
● Network Flow (8)
● Satisfiability (8)
● Independent Set (7)
● Vertex Coloring (7)
● Vertex Cover (5)
● Dictionaries (1)
● Kd-Trees (1)
file:///E|/WEBSITE/IMPLEMEN/DIMACS/IMPLEMEN.HTM (2 of 3) [19/1/2003 1:39:45]