Sciweavers

823 search results - page 56 / 165
» Brick partitions of graphs
Sort
View
DMIN
2006
151views Data Mining» more  DMIN 2006»
15 years 7 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- 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...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
15 years 5 months ago
Approximating the Domatic Number
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...
Uriel Feige, Magnús M. Halldórsson, ...
MICS
2008
124views more  MICS 2008»
15 years 4 months ago
Community Structures of Networks
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...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...
PVLDB
2010
116views more  PVLDB 2010»
15 years 26 days ago
Schism: a Workload-Driven Approach to Database Replication and Partitioning
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
Carlo Curino, Yang Zhang, Evan P. C. Jones, Samuel...
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
16 years 20 days ago
Fully Decomposable Split Graphs
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginge...