Valenciano, Alvin and Istiono, Wirawan (2020) Algorithm Analytic To Find Maximum Matching In Bipartite Graph. Journal of Applied Computer Science & Mathematics, 14 (29).
Full text not available from this repository.Abstract
Matching is a set of edges in a graph which each of the edge does not share a common vertex. Maximum Matching in a graph is number of maximum matching which a graph can have. Graph that will be used is guaranteed to be a bipartite graph that each of the vertices can be divided into two independent sets and edges in that graph always connect two vertices from different set. Topic in this journal is to find maximum matching in a graph. There are several approaches and optimizations to be done to achieve intended optimal solution. One of those optimization is vertices and edges compression so the algorithm can safely ignore duplicate vertices and edges in the graph. Purpose of this journal is to find accuracy and time complexity of all algorithm used to find maximum matching.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 15 Oct 2021 03:09 |
| Last Modified: | 15 Oct 2021 03:09 |
| URI: | https://kc.umn.ac.id/id/eprint/18789 |
Actions (login required)
 |
View Item |
