Minimum Cost Maximum Cardinality Matching Problem

Simple item page
dc.contributor.advisorGuta, Berhanu (PhD)
dc.contributor.authorMessay, Addis
dc.date.accessioned2018-07-11T07:52:54Z
dc.date.accessioned2023-11-04T12:31:26Z
dc.date.available2018-07-11T07:52:54Z
dc.date.available2023-11-04T12:31:26Z
dc.date.issued2012-01
dc.description.abstractThe 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 problemen_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/7889
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectMinimum Cost Maximum Cardinality Matching Problemen_US
dc.titleMinimum Cost Maximum Cardinality Matching Problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Addis Messay.pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics