#Planar-PM in Poly-time

Speaker: 

Nutan Limaye School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <br

Time: 

Friday, 20 November 2009 (All day)

Venue: 

  • A-212 (STCS Seminar Room)

The number of perfect matchings in planar graphs can be computed in polynomial (in the number of vertices) time.