Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation ©2004 Book News, Inc., Portland, OR (booknews.com)
"synopsis" may belong to another edition of this title.
Seller: Bookmonger.Ltd, HILLSIDE, NJ, U.S.A.
Hardcover. Condition: New. Seller Inventory # mon0000434097