Matchings in colored bipartite networks

Discrete Applied Mathematics - Tập 121 - Trang 261-277 - 2002
Tongnyoul Yi1, Katta G. Murty2, Cosimo Spera3
1Samsung Data Systems, Seoul, South Korea 120-020
2Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA
3Saltare.com, 2755 Campus Drive, San Mateo, CA-94403, USA

Tài liệu tham khảo

Chandrasekaran, 1982, Some NP-complete problems in linear programming, Oper. Res. Lett., 1, 101, 10.1016/0167-6377(82)90006-2 Gupta, 1981, Tree search method for optimal core management of pressurized water reactors, Comput. oper. Res., 8, 263, 10.1016/0305-0548(81)90013-7 Hopcroft, 1973, A n5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2, 225, 10.1137/0202019 A.V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Kibernetika 1 (1987) 7–11 (English translation in: CYBNAW 23 (1) (1987) 8–13). Murty, 1992 Papadimitriou, 1984, Polytopes and complexity, 295 Yi, 1994