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

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

Publisher： Edp Sciences

E-ISSN： 1290-385x|45|3|331-346

ISSN： 0988-3754

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

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

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

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

Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7

By Paschos Vangelis Th.  

RAIRO - Operations Research, Vol. 52, Iss. 1, 2018-05 ,pp. : 305-314

Edp Sciences

Access to resources Recommend Favorite

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗

By Laforest Christian   Phan Raksmey  

RAIRO - Operations Research, Vol. 47, Iss. 3, 2013-05 ,pp. : 199-221

Edp Sciences

Access to resources Recommend Favorite

Approximation hardness of graphic TSP on cubic graphs

By Karpinski Marek   Schmied Richard  

RAIRO - Operations Research, Vol. 49, Iss. 4, 2015-03 ,pp. : 651-668

Edp Sciences

Access to resources Recommend Favorite