Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > GRAPH PARTITITIONING:
Reports tagged with Graph Partititioning:
TR10-184 | 19th November 2010
Manjish Pal

Combinatorial Geometry of Graph Partitioning - I

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new directions of progress in the {\sc $c$-Balanced ... more >>>




ISSN 1433-8092 | Imprint