Title of article
A POLYNOMIAL ALGORITHM FOR MINDSC ON A SUBCLASS OF SERIES PARALLEL GRAPHS
Author/Authors
SALIM ACHOURI، نويسنده , , TIMOTHEE BOSSART AND ALIX MUNIER-KORDON، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
12
From page
145
To page
156
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.
Keywords
Polynomial algorithm , Minimum directed sumcut , series parallel graph
Journal title
RAIRO - Operations Research
Serial Year
2009
Journal title
RAIRO - Operations Research
Record number
665965
Link To Document