Learn More

1 bounds, graph partitioning, large scale. Abstract 4 We consider the problem of partitioning the node set of a graph into k sets of given sizes 5 in order to minimize the cut obtained using (removing) the k-th set. If the resulting cut has 6 value 0, then we have obtained a vertex separator. This problem is closely related to the graph 7 partitioning… (More)

- ‹
- 1
- ›