Sciweavers

ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 5 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
FCT
2005
Springer
14 years 5 months ago
Reconstructing Many Partitions Using Spectral Techniques
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...
Joachim Giesen, Dieter Mitsche