Perfectly matchable subgraph problem on a bipartite graph

E-ISSN： 1290-3868|44|1|27-42

ISSN： 0399-0559

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

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

Polynomial time algorithms for two classes of subgraph problem

By Sridharan Sriraman

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 291-298

Edp Sciences

Access to resources Recommend Favorite

The Reduction of Directed Cyclic Graph for Task Assignment Problem

MATEC Web of conference, Vol. 150, Iss. issue, 2018-02 ,pp. : 06031-06031

Edp Sciences

Access to resources Recommend Favorite

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

By Groshaus Marina Szwarcfiter Jayme Luis

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

Edp Sciences

Access to resources Recommend Favorite

Coupled field-circuit problem:a generalized signal flow graph description of the circuit equations*

By De Gersem H. Mertens R. Pahner U. Hameyer K. Belmans R.

EPJ Applied Physics (The), Vol. 1, Iss. 2, 2010-03 ,pp. : 247-251

Edp Sciences

Access to resources Recommend Favorite

Patch definition in metapopulation analysis: a graph theory approach to solve the mega‐patch problem

Ecology, Vol. 95, Iss. 2, 2014-02 ,pp. : 316-328

John Wiley & Sons Inc

Access to resources Recommend Favorite