A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6438113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs |
scientific article; zbMATH DE number 6438113 |
Statements
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (English)
0 references
21 May 2015
0 references
cluster deletion
0 references
sum coloring
0 references
\(P_4\)-sparse
0 references
graph algorithms
0 references
0 references
0.7755444645881653
0 references
0.7729538083076477
0 references
0.7260532975196838
0 references
0.7249347567558289
0 references
0.7232267260551453
0 references
