| dc.contributor.author | Bouchakour, Mustapha | |
| dc.contributor.author | Mahjoub, Ali Ridha | |
| dc.date.accessioned | 2009-12-10T11:11:16Z | |
| dc.date.available | 2009-12-10T11:11:16Z | |
| dc.date.issued | 1997 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/2657 | |
| dc.language.iso | en | en |
| dc.subject | Dominating set polytope | en |
| dc.subject | One-node cutset | en |
| dc.subject | Composition of polyhedra; | en |
| dc.subject.ddc | 003 | en |
| dc.title | One-node cutsets and the dominating set polytope | en |
| dc.type | Article accepté pour publication ou publié | |
| dc.contributor.editoruniversityother | Université de Bretagne Occidentale, Brest;France | |
| dc.description.abstracten | In 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.isversionofjnlname | Discrete Mathematics | |
| dc.relation.isversionofjnlvol | 165-166 | en |
| dc.relation.isversionofjnldate | 1997 | |
| dc.relation.isversionofjnlpages | 101-123 | en |
| dc.relation.isversionofdoi | http://dx.doi.org/10.1016/S0012-365X(96)00164-1 | en |
| dc.description.sponsorshipprivate | oui | en |
| dc.relation.isversionofjnlpublisher | Elsevier | en |
| dc.subject.ddclabel | Recherche opérationnelle | en |
