2314 search results - page 94 / 463 » Minimal Partitions of a Graph |
136
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
128
Voted
DMIN
2006
15 years 5 months ago
2006
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
132
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
125
click to vote
PDP
2003
IEEE
15 years 8 months ago
2003
IEEE
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
153
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...