A polyhedral study of the maximum edge subgraph problem (Q5891092)
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 polyhedral study of the maximum edge subgraph problem |
scientific article; zbMATH DE number 6189813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral study of the maximum edge subgraph problem |
scientific article; zbMATH DE number 6189813 |
Statements
A polyhedral study of the maximum edge subgraph problem (English)
0 references
19 July 2013
0 references
polyhedral combinatorics
0 references
maximum edge subgraph problem
0 references
0 references
0.9556798
0 references
0.9261925
0 references
0.9212937
0 references
0.9205179
0 references
0.9181619
0 references
0.91656667
0 references
0.91007483
0 references
0.89875084
0 references
