Sciweavers

483 search results - page 34 / 97
» On perfectness of sums of graphs
Sort
View
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
ECCV
2002
Springer
14 years 10 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
IPL
2008
104views more  IPL 2008»
13 years 8 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 8 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
13 years 8 months ago
On the Genus Distribution of (p, q, n)-Dipoles
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...
Terry I. Visentin, Susana W. Wieler