Clique partitioning of interval graphs with submodular costs on the cliques

Author： Gijswijt Dion   Jost Vincent   Queyranne Maurice  

Publisher： Edp Sciences

E-ISSN： 1290-3868|41|3|275-287

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.3, 2007-08, pp. : 275-287

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

Inductive computations on graphs defined by clique-width expressions

By Carrère Frédérique  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 3, 2009-04 ,pp. : 625-651

Edp Sciences

Access to resources Recommend Favorite

Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search

By Cáceres E. N.   Song S. W.   Szwarcfiter J. L.  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 3, 2010-10 ,pp. : 293-311

Edp Sciences

Access to resources Recommend Favorite

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

By Cerioli Marcia R.   Faria Luerbio   Ferreira Talita O.   Protti Fábio  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 3, 2011-09 ,pp. : 331-346

Edp Sciences

Access to resources Recommend Favorite

Clique-connecting forest and stable set polytopes

By Cornaz Denis  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 73-83

Edp Sciences

Access to resources Recommend Favorite

A note on the Chvátal-rank of clique family inequalities

By Pêcher Arnaud   Wagler Annegret K.  

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 289-294

Edp Sciences

Access to resources Recommend Favorite