A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

详细信息    查看全文

• 作者：Vadim V. Lozin ; Martin Milanič
• 关键词：Independent set ; Polynomial-time algorithm
• 刊名：Journal of Discrete Algorithms
• 出版年：2008
• 出版时间：December 2008
• 年：2008
• 卷：6
• 期：4
• 页码：595-604
• 全文大小：204 K

文摘

The class of fork-free graphs is an extension of claw-free graphs and their subclass of line graphs. The first polynomial-time solution to the maximum weight independent set problem in the class of line graphs, which is equivalent to the maximum matching problem in general graphs, has been proposed by Edmonds in 1965 and then extended to the entire class of claw-free graphs by Minty in 1980. Recently, Alekseev proposed a solution for the larger class of fork-free graphs, but only for the unweighted version of the problem, i.e., finding an independent set of maximum cardinality. In the present paper, we describe the first polynomial-time algorithm to solve the problem for weighted fork-free graphs.