Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

A polynomial algorithm for minDSC on a subclass of series Parallel graphs

Salim AchouriTimothée BossartAlix Munier-Kordon — 2009

RAIRO - Operations Research

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.

Page 1

Download Results (CSV)