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/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|