Cargando…
Cliques, coloring, and satisfiability
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. The Second DIMACS Challenge, on which this volume is based, took place in conjuncti...
Autores principales: | Johnson, David S, Trick, Michael A |
---|---|
Lenguaje: | eng |
Publicado: |
American Mathematical Society
1996
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2279800 |
Ejemplares similares
-
Excluding infinite clique minors
por: Robertson, Neil, et al.
Publicado: (1995) -
Topological rings satisfying compactness conditions
por: Ursul, Mihail
Publicado: (2002) -
On the functional equations satisfied by Eisenstein series
por: Langlands, Robert P
Publicado: (1976) -
Applying inversion to construct planar, rational spirals that satisfy two-point G(2) Hermite data
por: Kurnosenko, A
Publicado: (2010) -
Color-induced graph colorings
por: Zhang, Ping
Publicado: (2015)