A polyhedral study of the maximum edge subgraph problem (Q5916096): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 22:48, 29 February 2024
scientific article; zbMATH DE number 6109905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral study of the maximum edge subgraph problem |
scientific article; zbMATH DE number 6109905 |
Statements
A polyhedral study of the maximum edge subgraph problem (English)
0 references
22 November 2012
0 references
polyhedral combinatorics
0 references
quasi-cliques
0 references
maximum edge subgraph problem
0 references
