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 the normal view instead:
scientific article; zbMATH DE number 829916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8742914795875549
0 references
0.7835990786552429
0 references
0.7739315629005432
0 references
