Finding minimum 3-way cuts in hypergraphs

Mingyu Xiao. Finding minimum 3-way cuts in hypergraphs. Inf. Process. Lett., 110(14-15):554-558, 2010. [doi]

@article{Xiao10-2,
  title = {Finding minimum 3-way cuts in hypergraphs},
  author = {Mingyu Xiao},
  year = {2010},
  doi = {10.1016/j.ipl.2010.05.003},
  url = {http://dx.doi.org/10.1016/j.ipl.2010.05.003},
  researchr = {https://researchr.org/publication/Xiao10-2},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {110},
  number = {14-15},
  pages = {554-558},
}