School of Technology and Computer Science

#Planar-PM in Poly-time

Speaker:
Nutan Limaye School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road
Date:
Friday, 20 Nov 2009 (all day)
Venue:
A-212 (STCS Seminar Room)
Category:
Student Seminar
  event.ics     Print
Abstract
The number of perfect matchings in planar graphs can be computed in polynomial (in the number of vertices) time.