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

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki (2001)

> Home

Details and statistics

DOI: 10.1023/A:1011620607786

access: closed

type: Journal Article

metadata version: 2020-01-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ZhaoNI01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ZhaoNI01
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5(4): 397-410 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.