Messay, Addis (2012) Minimum Cost Maximum Cardinality Matching Problem. Masters thesis, Addis Ababa University.
![[img]](http://thesisbank.jhia.ac.ke/style/images/fileicons/application_pdf.png) |
PDF (Minimum Cost Maximum Cardinality Matching Problem)
Addis, Messay.pdf - Accepted Version Restricted to Repository staff only Download (1MB) | Request a copy |
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 where is set of nodes and is set of arcs. I have discussed cardinality matching problem by classifying into two versions called bipartite cardinality matching and nonbipartite cardinality matching problem.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Africana |
| Depositing User: | Selom Ghislain |
| Date Deposited: | 19 Jun 2018 13:12 |
| Last Modified: | 19 Jun 2018 13:12 |
| URI: | http://thesisbank.jhia.ac.ke/id/eprint/4440 |
Actions (login required)
 |
View Item |