Volume 43, Number 2, April-June 2009
|Page(s)||145 - 156|
|Published online||28 April 2009|
A polynomial algorithm for minDSC on a subclass of series Parallel graphs
LIP6 - Université Pierre et Marie Curie, 4 place Jussieu, 75252 Paris Cedex 05, France; Alix.Munier@lip6.fr
Accepted: 3 July 2008
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.
Mathematics Subject Classification: 05C78 / 05C85 / 90B35
Key words: Minimum directed sumcut / series parallel graph / polynomial algorithm.
© EDP Sciences, ROADEF, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.