A note on the hardness results for the labeledperfect matching problems in bipartite graphs

By Monnot Jérôme  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 315-324

Edp Sciences

Access to resources Recommend Favorite

Perfect Matching in General vs. Cubic Graphs:A Note on the Planar and Bipartite Cases

By Bampis E.   Giannakos A.   Karzanov A.   Manoussakis Y.   Milis I.  

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 2, 2010-03 ,pp. : 87-97

Edp Sciences

Access to resources Recommend Favorite

Complexity of chemical graphs in terms of size, branching, and cyclicity

By Balaban A. T.  

SAR and QSAR in Environmental Research, Vol. 17, Iss. 4, 2006-08 ,pp. : 429-466

Taylor & Francis Ltd

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

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