817 search results - page 3 / 164 » On 2-factors with k components |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
CATA
2000
13 years 10 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...