Search found 3 matches

by aab
Tue Jun 28, 2011 8:53 am
Forum: Volume 120 (12000-12099)
Topic: 12033 - Game of CS
Replies: 1
Views: 2340

12033 - Game of CS

Can anyone tell me how to solve this problem?
by aab
Wed Jun 22, 2011 12:14 pm
Forum: Algorithms
Topic: Counting in a DAG
Replies: 1
Views: 3337

Re: Counting in a DAG

Sort the vertices in topological order.You can do it in O(n+m) with dfs. Then for each vertex (starting from vertex of lower priority) calculate the sum of the weights of the vertices within its reach. This is also done in O(n+m). This should work.
by aab
Wed Jun 22, 2011 12:02 pm
Forum: Algorithms
Topic: Maximum matching
Replies: 1
Views: 3092

Maximum matching

Hi!
I would like to learn Edmond's Algorithm of maximum matching in any graph. Can anyone give some links where can I read about this algorithm or implementation of this algorithm? Thanks.

Go to advanced search