On the complexity of edge-colored subgraph partitioning problems in network optimization (Q2816508)
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: On the complexity of edge-colored subgraph partitioning problems in network optimization |
scientific article; zbMATH DE number 6618852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of edge-colored subgraph partitioning problems in network optimization |
scientific article; zbMATH DE number 6618852 |
Statements
23 August 2016
0 references
network optimization
0 references
monochromatic clique
0 references
multicolored cycle
0 references
partition
0 references
forbidden induced subgraphs
0 references
On the complexity of edge-colored subgraph partitioning problems in network optimization (English)
0 references
0.8509407043457031
0 references
0.7966800332069397
0 references
0.7762202024459839
0 references
0.7691339254379272
0 references
0.7681523561477661
0 references
