A polynomial algorithm for minDSC on a subclass of series Parallel graphs
Salim Achouri, Timothée Bossart, Alix Munier-Kordon · RAIRO - Operations Research · 2009
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.