2314 search results - page 11 / 463 » Minimal Partitions of a Graph |
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
This study investigates a new multiphase minimization scheme which embeds a simple, efficient partition constraint directly in multiple level set evolution. Starting from an arbit...
104
click to vote
DAM
1999
14 years 11 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
ARSCOM
2007
14 years 11 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
124
click to vote
ACPC
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...