| Article ID: | iaor200971027 |
| Country: | France |
| Volume: | 43 |
| Issue: | 2 |
| Start Page Number: | 145 |
| End Page Number: | 156 |
| Publication Date: | Apr 2009 |
| Journal: | RAIRO Operations Research |
| Authors: | Munier-Kordon Alix, Achhouri Salim, Bossart Timothee |
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.