|
|||||
|
|
Approximating maximum weight K-colorable subgraphs in chordal graphs |
|
| Authors: | Venkatesan T Chakaravarthy Sambuddha Roy |
| Affiliation: | IBM India Research Lab, New Delhi, India |
| 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. |
| Keywords: | Approximation algorithms Chordal graphs Coloring Interval graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |