The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376)
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: The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. |
scientific article; zbMATH DE number 2069724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. |
scientific article; zbMATH DE number 2069724 |
Statements
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (English)
0 references
27 May 2004
0 references
Polytope
0 references
Cut
0 references
\(k\)-Edge connected graph
0 references
Critical extreme point
0 references
0 references
0 references
0 references
0 references
