A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585926 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997781543 / rank | |||
Normal rank | |||
Latest revision as of 11:14, 30 July 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
