Guta, Berhanu (PhD)Messay, Addis2018-07-112023-11-042018-07-112023-11-042012-01http://etd.aau.edu.et/handle/123456789/7889The 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 problemenMinimum Cost Maximum Cardinality Matching ProblemThesis