| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428714 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We present a 2-approximation algorithm for the problem of finding the maximum weight K-colorable subgraph in a given chordal graph with node weights. The running time of the algorithm is O(K(n+m)), where n and m are the number of vertices and edges in the given graph.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
