Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

ask a bi-partite problem...

Posted by qiqilrq at 2007-11-11 20:02:16 on Problem 1632 and last updated at 2007-11-11 20:59:49 
given a bi-partite, find a maximum k, such that there exist node set S1,S2,

1) S1 belongs to Left node set,S2 belongs to Right node set
2) |S1| = |S2| = k
2) for any u in S1, v in S2,  edge (u,v) is in match edge set M
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator