Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

@article{Zhao2001ApproximatingTM,
  title={Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts},
  author={Liang Zhao and Hiroshi Nagamochi and Toshihide Ibaraki},
  journal={J. Comb. Optim.},
  year={2001},
  volume={5},
  pages={397-410}
}
15 Citations
0 References
Similar Papers