1952 search results - page 93 / 391 » Complete partitions of graphs |
138
click to vote
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...
139
click to vote
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...
152
click to vote
MICS
2008
15 years 2 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
106
click to vote
IJCGA
1998
15 years 3 months ago
1998
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
178
click to vote
PVLDB
2010
14 years 11 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...