Skip to Main content Skip to Navigation
Journal articles

A Polynomial algorithm for minDSC on series-parallel graphs

Abstract : The aim of this paper is to show a polynomial algorithm for the problem minimum directed sumcut for a class of series parallel digraphs. The method uses the recursive structure of parallel compositions in order to define a dominating set of orders. Then, the optimal order is easily reached by minimizing the directed sumcut. It is also shown that this approach cannot be applied in two more general classes of series parallel digraphs.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01197186
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Friday, September 11, 2015 - 11:54:49 AM
Last modification on : Sunday, June 26, 2022 - 9:51:46 AM

Links full text

Identifiers

Citation

Salim Achouri, Timothée Bossart, Alix Munier-Kordon. A Polynomial algorithm for minDSC on series-parallel graphs. RAIRO - Operations Research, EDP Sciences, 2009, 43 (2), pp.145-156. ⟨10.1051/ro/2009009⟩. ⟨hal-01197186⟩

Share

Metrics

Record views

90