On the computational complexity of strong edge coloring (Q1602692)
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 computational complexity of strong edge coloring |
scientific article; zbMATH DE number 1758379
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of strong edge coloring |
scientific article; zbMATH DE number 1758379 |
Statements
On the computational complexity of strong edge coloring (English)
0 references
24 June 2002
0 references
strong edge coloring
0 references
maximum antimatching problem
0 references
0 references
0.9348625
0 references
0.9282052
0 references
0.9219114
0 references
0 references
0 references
0 references
