A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129)
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 linear programming formulation for the maximum complete multipartite subgraph problem |
scientific article; zbMATH DE number 2246755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear programming formulation for the maximum complete multipartite subgraph problem |
scientific article; zbMATH DE number 2246755 |
Statements
A linear programming formulation for the maximum complete multipartite subgraph problem (English)
0 references
13 January 2006
0 references
0.7766000032424927
0 references
0.7432408332824707
0 references
0.7373405694961548
0 references
