Show simple item record

dc.contributor.authorBouchakour, Mustapha
dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2009-12-10T11:11:16Z
dc.date.available2009-12-10T11:11:16Z
dc.date.issued1997
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2657
dc.language.isoenen
dc.subjectDominating set polytopeen
dc.subjectOne-node cutseten
dc.subjectComposition of polyhedra;en
dc.subject.ddc003en
dc.titleOne-node cutsets and the dominating set polytopeen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité de Bretagne Occidentale, Brest;France
dc.description.abstractenIn this paper we study a composition (decomposition) technique for the dominating set polytope in graphs which are decomposable by one-node cutsets. If G decomposes into G1 and G2, we show that the dominating set polytope of G can be described from two linear systems related to G1 and G2. This gives a way to characterize this polytope for classes of graphs that can be recursively decomposed. This also gives a procedure to describe facets for this polytope. Application of these techniques is discussed for the class of the cactus.en
dc.relation.isversionofjnlnameDiscrete Mathematics
dc.relation.isversionofjnlvol165-166en
dc.relation.isversionofjnldate1997
dc.relation.isversionofjnlpages101-123en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/S0012-365X(96)00164-1en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record