Solving a combinatorial problem with network flows |
| |
| Authors: | Florin Manea Cąlina Ploscaru |
| |
| Affiliation: | 1. Faculty of Mathematics and Computer Science, Bucharest University, Academiei str., no. 14, 70109, Bucharest, Romania
|
| |
| Abstract: | In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graphG=(V 1 ∪V 2,E, w) outputs the enumeration of all bipartite matchings of given cardinalityv and costc. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
