Clique partitioning of interval graphs with submodular costs on the cliques

By Gijswijt Dion   Jost Vincent   Queyranne Maurice  

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

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

Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations

By Ktari Mouna   Haddar Mohamed Amine   Mosbah Mohamed   Hadj Kacem Ahmed  

RAIRO - Theoretical Informatics and Applications, Vol. 51, Iss. 2, 2017-11 ,pp. : 51-70

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