-
Same authors
- PubMed -
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
||||||||||||||||||
Perfectly matchable subgraph problem on a bipartite graph
Firdovsi Sharifov
Glushkov Institute of Cybernetics, Glushkova pr. 40, MSP,
252650 Kyiv, Ukraine; F-sharifov@yandex.ru
We consider the maximum weight perfectly matchable subgraph problem
on a bipartite graph G=(UV,E) with respect to given nonnegative
weights of its edges. We show that G has a perfect matching if and
only if some vector indexed by the nodes in UV is a base of an
extended polymatroid associated with a submodular function defined
on the subsets of UV. The dual problem of the separation problem
for the extended polymatroid is transformed to the special maximum
flow problem on G. In this paper, we give a linear programming
formulation for the maximum weight perfectly matchable subgraph
problem and propose an
algorithm to solve it.
Mathematics Subject Classification: 05C70 / 05C85
Key words: Bipartite graph / extended polymatroid / perfect matching / perfectly matchable subgraph
© EDP Sciences, ROADEF, SMAI, 2010
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook