3471 search results - page 249 / 695 » Obstacle Numbers of Graphs |
157
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
152
click to vote
JGT
2007
15 years 6 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
207
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
172
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...