The complexity of list edge-partitions for simple graphs (Q730267)
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: The complexity of list edge-partitions for simple graphs |
scientific article; zbMATH DE number 6668594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of list edge-partitions for simple graphs |
scientific article; zbMATH DE number 6668594 |
Statements
The complexity of list edge-partitions for simple graphs (English)
0 references
27 December 2016
0 references
\(M\)-edge-partition problem
0 references
0.8067837357521057
0 references
0.7953808903694153
0 references
0.7952871918678284
0 references
0.7899792790412903
0 references
