Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs*, **

Author： Groshaus Marina   Szwarcfiter Jayme Luis  

Publisher： Edp Sciences

E-ISSN： 1290-3868|45|3|209-222

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.45, Iss.3, 2011-10, pp. : 209-222

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

Bipartite binomial heaps

By Elmasry Amr   Jensen Claus   Katajainen Jyrki  

RAIRO - Theoretical Informatics and Applications, Vol. 51, Iss. 3, 2017-12 ,pp. : 121-133

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

Perfectly matchable subgraph problem on a bipartite graph

By Sharifov Firdovsi  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 27-42

Edp Sciences

Access to resources Recommend Favorite

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