A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:04, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts |
scientific article |
Statements
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (English)
0 references
1 February 1996
0 references
polyhedral combinatorics
0 references
maximum \(s- t\) flow problem
0 references
