A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6299351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9338105
0 references
0.8904354
0 references
0 references
0 references
0.8890771
0 references
0.8886499
0 references
0.8852763
0 references
0 references
0.8802543
0 references
