Minimum Cost Maximum Cardinality Matching Problem
No Thumbnail Available
Date
2012-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
The complete set of this paper focuses on maximum cardinality matching and minimum cost maximum cardinality matching problem with their algorithms which solve cardinality matching in a graph G=(N,A)where N is set of N nodes and A is set ofM arcs. I have discussed cardinality matching problem by classifying into two versions called bipartite cardinality matching and nonbipartite cardinality matching problem
Description
Keywords
Minimum Cost Maximum Cardinality Matching Problem