"Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph."

Andrey Grishkevich (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-31254-1_9

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ip-c/Grishkevich19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ip-c/Grishkevich19
Andrey Grishkevich:
Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph. IP&C 2019: 65-72

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.