Introduction tw t P m c in planar graphs Algorithm Conclusion

1/12 Introduction tw ≤ t P.m.c. in planar graphs Algorithm Conclusion Exact algorithm for the Maximum Induced Planar Subgraph Problem Fedor Fomin Ioan Todinca Yngve Villanger University of Bergen, Universite d'Orleans Workshop on Graph Decompositions, CIRM, October 19th, 2010

• introduction tw ≤


• finite combinatorial


• exact algorithms


• combinatorial results


• planar graphs


• algorithm conclusion


• problems can


• hard problems