Satisfactory graph partition, variants, and generalizations (Q976309)
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: Satisfactory graph partition, variants, and generalizations |
scientific article; zbMATH DE number 5720317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfactory graph partition, variants, and generalizations |
scientific article; zbMATH DE number 5720317 |
Statements
Satisfactory graph partition, variants, and generalizations (English)
0 references
11 June 2010
0 references
combinatorial optimization
0 references
complexity theory
0 references
vertex partition
0 references
degree constraints
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.9366019368171692
0 references
0.9353824853897096
0 references
0.9237325191497804
0 references
0.8829109072685242
0 references
