# Ningchuan Wang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

- Full text PDF available (1)

Learn More

- Ting Kei Pong, Hao Sun, Ningchuan Wang, Henry Wolkowicz
- Comp. Opt. and Appl.
- 2016

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 problem. In fact, the model we use is the same as that… (More)

- ‹
- 1
- ›