A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation
Let G be an undirected bipartite graph with positive integer weights on the edges. We refine the existing decomposition theorem originally proposed by Kao et al., for computing maximum weight bipartite matching. We apply it to design an efficient version of the decomposition algorithm to compute the...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Alexandru Ioan Cuza University of Iasi
2020-08-01
|
| סדרה: | Scientific Annals of Computer Science |
| נושאים: | |
| גישה מקוונת: | https://www.info.uaic.ro/en/sacs_articles/a-modied-decomposition-algorithm-for-maximum-weight-bipartite-matching-and-its-experimental-evaluation/ |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|