Sciweavers

JMLR
2010
115views more  JMLR 2010»
13 years 6 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
CPC
2010
117views more  CPC 2010»
13 years 8 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 11 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
13 years 11 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
13 years 11 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 11 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
ENDM
2007
104views more  ENDM 2007»
13 years 11 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink
JGT
2006
97views more  JGT 2006»
13 years 11 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus
CORR
2006
Springer
80views Education» more  CORR 2006»
13 years 11 months ago
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
Shmuel Friedland, Daniel Levy
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 11 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik