default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Graphs, Morphisms and Statistical Physics 2001
- Jaroslav Nesetril, Peter Winkler:
Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63, DIMACS/AMS 2004, ISBN 978-0-8218-3551-7 - Forward. Graphs, Morphisms and Statistical Physics 2001: vi-
- Preface. Graphs, Morphisms and Statistical Physics 2001: ix-
- Photographs. Graphs, Morphisms and Statistical Physics 2001: xi-
- List of delivered talks. Graphs, Morphisms and Statistical Physics 2001: xiii-
- List of Participants. Graphs, Morphisms and Statistical Physics 2001: xv-
- Stefan Boettcher:
Efficient Local Search Near Phase Transitions in CombinatorialOptimization. 1-12 - Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali:
On the Sampling Problem for H-Colorings on the Hypercubic Lattice. 13-28 - Graham R. Brightwell, Peter Winkler:
Graph Homomorphisms and Long Range Action. 29-47 - Amir Daneshgar, Hossein Hajiabolhassan:
Random Walks and Graph Homomorphisms. 49-63 - Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Recent Results on Parameterized H-Colorings. 65-85 - Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. 87-95 - David J. Galvin, Prasad Tetali:
On Weighted Graph Homomorphisms. 97-104 - Pavol Hell, Jaroslav Nesetril:
Counting List Homomorphisms and Graphs with Bounded Degrees. 105-112 - Gabriel Istrate:
On the Satisfiability of Random k-Horn Formulae. 113-136 - Jacob Katriel:
The Exchange Interaction, Spin Hamiltonians, and the SymmetricGroup. 137-143 - Martin Loebl:
A Discrete Non-Pfaffian Approach to the Ising Problem. 145-154 - Elchanan Mossel:
Survey: Information Flow on Trees. 155-170 - Claude Tardif:
Chromatic Numbers of Products of Tournaments: FractionalAspects of Hedetniemi's Conjecture. 171-175 - Xuding Zhu:
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs. 177-193
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
