A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts |
scientific article; zbMATH DE number 829916
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts |
scientific article; zbMATH DE number 829916 |
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
