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

Author： Achouri Salim   Bossart Timothée   Munier-Kordon Alix  

Publisher： Edp Sciences

E-ISSN： 1290-3868|43|2|145-156

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.43, Iss.2, 2009-04, pp. : 145-156

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Minimum convex-cost tension problems on series-parallel graphs

By Bachelet Bruno   Mahey Philippe  

RAIRO - Operations Research, Vol. 37, Iss. 4, 2010-03 ,pp. : 221-234

Edp Sciences

Access to resources Recommend Favorite

Polynomial Digital Control of a Series Equal Liquid Tanks

By  

MATEC Web of conference, Vol. 76, Iss. issue, 2016-10 ,pp. : 01002-01002

Edp Sciences

Access to resources Recommend Favorite

Series which are both max-plus and min-plus rational are unambiguous

By Lombardy Sylvain   Mairesse Jean  

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 1, 2010-03 ,pp. : 1-14

Edp Sciences

Access to resources Recommend Favorite

An algorithm for multiparametric min max 0-1-integer programmingproblems relative to the objective function

By Quintero José Luis   Crema Alejandro  

RAIRO - Operations Research, Vol. 39, Iss. 4, 2006-04 ,pp. : 243-252

Edp Sciences

Access to resources Recommend Favorite

A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata

By Kirsten Daniel  

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 3, 2008-06 ,pp. : 553-581

Edp Sciences

Access to resources Recommend Favorite