School of Technology and Computer Science Seminars

#Planar-PM in Poly-time

by Dr. Nutan Limaye (STCS)

Friday, November 20, 2009 from to (Asia/Kolkata)
at Colaba Campus ( A-212 )
Description
The number of perfect matchings in planar graphs can be computed in polynomial (in the number of vertices) time.
Organised by John Barretto