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)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. FW-9780821835517
Anzahl: 2 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. illustrated edition edition. 193 pages. 10.20x6.90x0.70 inches. In Stock. Artikel-Nr. __0821835513
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Inspired by issues and intriguing questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. This title includes proceedings of that meeting. It is suitable for graduate students and research mathematicians interested in probabilistic graph theory and its applications. Editor(s): Nesetril, Jaroslav; Winkler, P. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 193 pages, Illustrations. BIC Classification: PBPD; PBV; PBWL. Category: (P) Professional & Vocational. Weight in Grams: 595. . 2004. hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780821835517
Anzahl: 1 verfügbar