"A Greedy Algorithm for Minimum Cut into Bounded Sets Problem."

Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi (2021)

> Home

Details and statistics

DOI: 10.23919/CNSM52442.2021.9615583

access: closed

type: Conference or Workshop Paper

metadata version: 2021-12-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cnsm/UgurluAE21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cnsm/UgurluAE21
Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi:
A Greedy Algorithm for Minimum Cut into Bounded Sets Problem. CNSM 2021: 422-426

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.