Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11-13, 1993
Ene 1996 · Center for Discrete Mathematics and Theoretical Computer Science New Brunswick, NJ: DIMACS series in discrete mathematics and theoretical computer science Aklat 26 · American Mathematical Soc.
E-book
657
Mga Page
Tungkol sa ebook na ito
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.
I-rate ang e-book na ito
Ipalaam sa amin ang iyong opinyon.
Impormasyon sa pagbabasa
Mga smartphone at tablet
I-install ang Google Play Books app para sa Android at iPad/iPhone. Awtomatiko itong nagsi-sync sa account mo at nagbibigay-daan sa iyong magbasa online o offline nasaan ka man.
Mga laptop at computer
Maaari kang makinig sa mga audiobook na binili sa Google Play gamit ang web browser ng iyong computer.
Mga eReader at iba pang mga device
Para magbasa tungkol sa mga e-ink device gaya ng mga Kobo eReader, kakailanganin mong mag-download ng file at ilipat ito sa iyong device. Sundin ang mga detalyadong tagubilin sa Help Center para mailipat ang mga file sa mga sinusuportahang eReader.
