1977 search results - page 228 / 396 » The satisfactory partition problem |
115
click to vote
EOR
2010
15 years 4 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
110
click to vote
ENDM
2007
15 years 4 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
135
click to vote
DPD
2000
15 years 4 months ago
2000
The Internet has solved the age-old problem of network connectivity and thus enabling the potential access to, and data sharing among large numbers of databases. However, enabling ...
146
click to vote
IPL
2002
15 years 4 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
114
click to vote
PAMI
1998
15 years 4 months ago
1998
—Image segmentation is fundamental to many image analysis problems. It aims to partition a digital image into a set of nonoverlapping homogeneous regions. The main contribution o...