An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs

作者：Liu, Yunlong; Wang, Jianxin^*; Xu, Chao; Guo, Jiong; Chen, Jianer

来源：Journal of Combinatorial Optimization, 2015, 29(1): 257-275.

DOI：10.1007/s10878-014-9733-1

• Branching strategy
• Edge modification
• Multiple forbidden induced subgraph

Branching on forbidden induced subgraphs is a genetic strategy to obtain parameterized algorithms for many edge modification problems. For such a problem in which the graph property is defined by multiple forbidden induced subgraphs, branching process is trivially performed on each subgraph. Thus, the size of the resulting search tree is dominated by the size of the largest forbidden subgraph. In this paper, we present a simple strategy for deriving significantly improved branching rules to deal with multiple forbidden subgraphs by edge modifications. The basic idea hereby is that while constructing branching rules for the largest forbidden subgraph, we sufficiently take into account the structural relationship between it and other forbidden subgraphs. By applying this strategy, we obtain improved parameterized algorithms for edge modification problems for several graph properties such as 3-leaf power, proper interval, threshold and co-trivially perfect graphs.

• 出版日期2015-1
• 单位湖南师范大学