Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes (Q4726018): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:16, 7 February 2024
scientific article; zbMATH DE number 3999624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes |
scientific article; zbMATH DE number 3999624 |
Statements
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes (English)
0 references
1987
0 references
connected binary matroid
0 references
polynomial time algorithms
0 references
