4 Questions 11 Answers 0 Followers
Questions related from Shibsankar Das
Let G be a un-weighted bipartite graph and M = Maximum Cardinality Matching of G is given. How to find the vertex cover of G in time linear in terms of edges of G?
09 September 2014 4,410 1 View
I want to know more about several detailed applications of "Approximate and Parameterized string matching" such as in Biro-informatics, DNA Sequence etc.
09 September 2014 6,816 0 View
Can one do Parallel Computing coding in MATLAB ?I want to implement some parallel algorithm in MATLAB. To be more specific, I want to implement the parallel maximum weight bipartite matching...
07 July 2014 4,426 12 View
Preferably Hopcroft-Karp Algorithm
07 July 2014 2,381 2 View