Document
Services
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook
|
||||||||||||||||||
RAIRO-Oper. Res. 43 (2009) 145-156
DOI: 10.1051/ro/2009009
A polynomial algorithm for minDSC on a subclass of series Parallel graphs
Salim Achouri, Timothée Bossart and Alix Munier-KordonLIP6 - Université Pierre et Marie Curie, 4 place Jussieu, 75252 Paris Cedex 05, France; Alix.Munier@lip6.fr
Received June 30, 2007. Accepted July 3, 2008. Published online 28 April 2009
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.
Mathematics Subject Classification. 05C78, 05C85, 90B35.
Key words: Minimum directed sumcut, series parallel graph, polynomial algorithm.
© EDP Sciences, ROADEF, SMAI 2009
| What is OpenURL? |
The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.