A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms

Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura. A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discrete Applied Mathematics, 65(1-3):167-190, 1996. [doi]

@article{DaiIIKOY96,
  title = {A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms},
  author = {Yang Dai and Hiroshi Imai and Kazuo Iwano and Naoki Katoh and Keiji Ohtsuka and Nobuhiko Yoshimura},
  year = {1996},
  doi = {10.1016/0166-218X(95)00034-O},
  url = {http://dx.doi.org/10.1016/0166-218X(95)00034-O},
  researchr = {https://researchr.org/publication/DaiIIKOY96},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {65},
  number = {1-3},
  pages = {167-190},
}