Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121)
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: Approximating maximum weight K-colorable subgraphs in chordal graphs |
scientific article; zbMATH DE number 5722005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs |
scientific article; zbMATH DE number 5722005 |
Statements
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (English)
0 references
16 June 2010
0 references
approximation algorithms
0 references
chordal graphs
0 references
coloring
0 references
interval graphs
0 references
0.8111255168914795
0 references
0.800082266330719
0 references
0.7899338006973267
0 references
0.7644837498664856
0 references
0.763055682182312
0 references
