Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

SOLVING A COMBINATORIAL PROBLEM WITH NETWORK FLOWS

  • MANEA FLORIN (Faculty of Mathematics and Computer Science, Bucharest University) ;
  • PLOSCARU CALINA (Faculty of Mathematics and Computer Science, Bucharest University)
  • 발행 : 2005.01.01

⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드