A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982)
From MaRDI portal
scientific article; zbMATH DE number 6299351
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts |
scientific article; zbMATH DE number 6299351 |
Statements
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (English)
0 references
2 June 2014
0 references
