Recognition and Optimization Algorithms for <i>P</i>₅-Free Graphs

Abstract

The weighted independent set problem on P 5 -free graphs has numerous applications, including data mining and dispatching in railways. The recognition of P 5 -free graphs is executed in polynomial time. Many problems, such as chromatic number and dominating set, are NP-hard in the class of P 5 -free graphs. The size of a minimum independent feedback vertex set that belongs to a P 5 -free graph with n vertices can be computed in O ( n 16 ) time. The unweighted problems, clique and clique cover, are NP-complete and the independent set is polynomial. In this work, the P 5 -free graphs using the weak decomposition are characterized, as is the dominating clique, and they are given an O ( n ( n + m ) ) recognition algorithm. Additionally, we calculate directly the clique number and the chromatic number; determine in O ( n ) time, the size of a minimum independent feedback vertex set; and determine in O ( n + m ) time the number of stability, the dominating number and the minimum clique cover.

Keywords

• <i>p</i>₅-free graphs
• weak decomposition
• recognition algorithm
• optimization algorithm
• symmetric graph