What is "Bipartite Match" ?

hank · Post by **hank** » Wed Jul 23, 2003 7:57 am

Can you tell me what is Bipartite Match?
and which of the problems in the volume can be solved by the algorithm?
Thank many.

bugzpodder · Post by **bugzpodder** » Mon Aug 04, 2003 2:42 am

a graph is bipartite if you can seperate its vertices into two groups and for every edge, its two vertices are in not in the same group. for more info, google it. the problems can be solved using i think network flow, and 10092 i think is an example.

anupam · Post by **anupam** » Mon Aug 04, 2003 1:28 pm

you may get help from the book of rosen(discrete math) and from the book of clrs(algorithm).
check them and it will be very clear.
--
Anupam

anupam · Post by **anupam** » Mon Aug 04, 2003 1:28 pm

you may get help from the book of rosen(discrete math) and from the book of clrs(algorithm).
check them and it will be very clear.
--
Anupam

Steven Halim · Post by **Steven Halim** » Wed Oct 01, 2003 7:17 pm

(I've just post similar message to max flow thread)

Max Bipartite Matching problems:
670 - the dog task
753 - a plug for unix
10080 - gopher 2

(and may be more...)