Thumbnail
Access Restriction
Subscribed

Author Hsu, Wen-Lian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1988
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1988-06-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 35
Issue Number 3
Page Count 29
Starting Page 535
Ending Page 563


Open content in new tab

   Open content in new tab
Source: ACM Digital Library