A Seminar About " An O(n) Time Algorithm For Maximum Matching Problem on Some Bipartite Graphs " in FCITR
A seminar in Faculty of Computing and Information Technology at Rabigh about " An O(n) time algorithm for maximum matching problem on some bipartite graphs "  presented by Dr. Ruzayn Qadora on Monday 30/5/2011 at 12:00 noon.
The following is a brief about the seminar:
It is known that the best algorithm for solving matching problem in bipartite graphs is  . We propose here an O(n) time algorithm to solve this problem under certain conditions. We show also that this algorithm is applicable for the class of bipartite Star123, P7-free graphs and the class of bipartite Star123-free graphs.





Last Update
6/14/2011 12:33:54 AM
 

Add Your Comment
Name :
 
Email :
 
Mobile No. :
Comment Title :
 
Comment Text :
 
Enter the text as in the picture :