A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:10, 5 March 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