Introduction tw t P m c in planar graphs Algorithm Conclusion

Fedor Fomin

Description

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

Sujets

• Independent
• Feedback
• Planar graph

Informations

• Publié par: pefav
• Nombre de lectures: 19
• Langue: English

Extrait

1/12 Introductiotn≤wPtm.c.i.pnalrgnaphralgsAitoroCmhulcnnois

Exact algorithm for the Maximum Induced Planar Subgraph Problem

Fedor Fomin Ioan Todinca

Yngve Villanger

Workshop on Graph Decompositions, CIRM, October 19th, 2010

UniversityofBergen,Universit´ed’Orle´ans

/2 nI 21 dortnilpnarargpashlAuctiontw≤tP.m.c.nmCthrigoiousclon 3.mbCoatiniaorserlstluimnoamin analpfoseuqilcla goalAn4. s.phrarg noasalitnaugtlir axim ial m tentndpo

1.[Fomin, Villanger, STACS 2010]: anO(1.73601 n ∙n t+3 ) algorithm for theMax Induced Subgraph of Theewidth≤t 2.[Robertson, Seymour 1986; Fomin, Thilikos 2006]: planar graphs have treewidthO( √ n)

Ingredients: 1.[Fomin

Theorem There is an O(1.73601 n )algorithm for theMax Induced Planar Subgraphproblem.

itgnvereirhtpmtugether

Outline of the result

ythingto

mhtittupanA.rogl4

1.[Fomin, Villanger, STACS 2010]: anO(1.73601 n ∙n t+3 ) algorithm for theMax Induced Subgraph of Theewidth≤t 2.[Robertson, Seymour 1986; Fomin, Thilikos 2006]: planar graphs have treewidthO( √ n) 3.Combinatorial results onminimal triangulationsandpotential maximal cliquesof planar graphs.

Ingredients: 1.[Fomin

teehr

Theorem There is an O(1.73601 n )algorithm for theMax Induced Planar Subgraphproblem.

Outline of the result

thingtogingevery I 2 tnorudtcoitn≤w 2/1 isnocnulCohmitorlgsAphragranalpni.c.m.Pt