A Unified Approach for Solving Vertex Partitioning Problems in Polynomial Time

Remy Belmonte

Description

Introduction and definitions Some results Conclusion A Unified Approach for Solving Vertex Partitioning Problems in Polynomial Time Remy Belmonte Martin Vatshelle Department of Informatics, University of Bergen, Norway 2nd Workshop on Graph Decompositions Theoretical, Algorithmic and Logical Aspects October 19, 2010 Remy Belmonte, Martin Vatshelle University of Bergen Solving Vertex Partitioning Problems 1/ 33

• vertex partitioning


• bergen solving


• tolerance strongly


• trivially perfect


• perfect comparability


• bounded tolerance


• k?trapezoid circular


• polynomial time

Sujets

• Belmonte
• Time complexity

Informations

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

Extrait

Re´myBelmonteMartinVatshelle DepartmentofInformatics,UniversityofBergen,Norway 2ndWorkshoponGraphDecompositionsTheoretical, AlgorithmicandLogicalAspects October19,2010 AUnifiedApproachforSolvingVertexPartitioning ProblemsinPolynomialTime 33/1smelborPgninoititraPxetreVgnivloSnegreBfoytisrevinUellehstaVnitraM,etnomleByme´R noisulcnoC stluseremoS snoitinfieddnanoitcudortnI

treVgnivloSnegreBfoytisrevinUellehstaVnitraM,etnomleByme´R Findinglargegraphclasseshavingboolean-widthO(logn). Ourgoal Bui-Xuan,TelleandVatshelle[’09]showedthatcertainvertexpartitioningproblems canbesolvedinpolynomialtimeongraphshavingboolean-widthO(logn).These problemsinclude: IndependentSet, DominatingSet, PerfectCode, k-Coloring, H-Cover, H-Homomorphism, Motivation noisulcnoC stluseremoS snoitinfieddnanoitcudortnI 33/2smelborPgninoititraPxe

hparG e´RymeBmlnoet classes ,aMtrniaVstehl Introductionanddefinitions Someresults Conclusion ordered elU yb inevsrti inclusion yfoeBgrneoSvlnigeVtrxeaPtrtioiingnrPboelsm/333