Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

2/52Fast Exponential-Time AlgorithmsBranchingThe Algorithm of Fomin et al.The simple Branch & Reduce algorithm of Fomin et al.int mis(G) {(0) if (|V (G)| ≤ 1) return |V (G)| ;(1) if (∃ component C ⊂ G)return mis(C)+mis(G − C) ;(2) if (∃ nodes v and w : N[w] ⊆ N[v])return mis(G − {v}) ;(3) if (∃ a node v with d(v) = 2)return 1+mis(˜G(v)) ;(4) select a node v of maximum degree, which minimizes |E(N(v))| ;return max{mis(G − {v} − M(v)), 1+mis(G − N[v])} ;}