1605 search results - page 106 / 321 » On Partitional Labelings of Graphs |
105
Voted
DMIN
2006
15 years 2 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...
111
click to vote
SIAMCOMP
2002
15 years 8 days 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...
115
Voted
MICS
2008
14 years 11 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...
135
Voted
PVLDB
2010
14 years 7 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...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...