Affiliation:
1. Northwestern Univ., Evanston, IL
Abstract
Efficient decomposition algorithms for the weighted maximum independent set, minimum coloring, and minimum clique cover problems on planar perfect graphs are presented. These planar graphs can also be characterized by the absence of induced odd cycles of length greater than 3 (odd holes). The algorithm in this paper is based on decomposing these graphs into essentially two special classes of inseparable component graphs whose optimization problems are easy to solve, finding the solutions for these components and combining them to form a solution for the original graph. These two classes are (i) planar comparability graphs and (ii) planar line graphs of those planar bipartite graphs whose maximum degrees are no greater than three. The same techniques can be applied to other classes of perfect graphs, provided that efficient algorithms are available for their inseparable component graphs.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. BLAND R. G. GOLDFARB D. AND TODD M.J. The ellipsoid method: A survey. Oper. Res. 29 (!98!) !039-!09!. BLAND R. G. GOLDFARB D. AND TODD M.J. The ellipsoid method: A survey. Oper. Res. 29 (!98!) !039-!09!.
2. Polynomial algorithms for perfect ~aphs;LovXsz L., AND SCHRIJVER, A;Ann. Discrete Math.,1985
3. Coloring planar perfect graphs by decomposition
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献