154 search results - page 12 / 31 » Odd subgraphs and matchings |
CPC
2010
13 years 7 months ago
2010
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)...
DAM
2007
13 years 9 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
ICDAR
2009
IEEE
14 years 4 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
DMTCS
2010
13 years 7 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...