Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes (Q4726018): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.12.1.72 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070851851 / rank | |||
Normal rank | |||
Latest revision as of 14:39, 19 March 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
