1. On the hardness of approximating multicut and sparsest-cut;Chawla;Comput. Complexity,2006
2. M. Chimani, C. Gutwenger, P. Mutzel, On the minimum cut of planarizations, Tech. Rep. TR06-1-003, University of Dortmund, Germany, 2005
3. Hardness of cut problems in directed graphs;Chuzhoy,2006
4. Graph Theory;Diestel,2005
5. On the structure of a family of minimal weighted cuts in a graph;Dinits,1976