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

Author： Monnot Jérôme  

Publisher： Edp Sciences

E-ISSN： 1290-3868|42|3|315-324

ISSN： 0399-0559

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

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

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

The complexity of short schedulesfor uet bipartite graphs

By Bampis Evripidis  

RAIRO - Operations Research, Vol. 33, Iss. 3, 2010-03 ,pp. : 367-370

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

A note on the Size-Ramsey number of long subdivisions of graphs

By Donadelli Jair   Haxell Penny E.   Kohayakawa Yoshiharu  

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 1, 2010-03 ,pp. : 191-206

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