http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Solving a combinatorial problem with networkflows
Florin Manea,C\u alina Ploscaru 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1-2
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 graph G = (V1 [ V2,E,w) outputs the enumeration of all bipartite matchings of given cardinality v and cost c.
SOLVING A COMBINATORIAL PROBLEM WITH NETWORK FLOWS
MANEA, FLORIN,PLOSCARU, CALINA 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1
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 graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.