School of Technology and Computer Science Seminars

#Planar-PM in Poly-time

Name: #Planar-PM in Poly-time
Start: 2009-11-20T16:00:00+05:30
End: 2009-11-20T17:00:00+05:30
Location: Colaba Campus

by Dr Nutan Limaye (STCS)

Friday 20 Nov 2009, 16:00 → 17:00 Asia/Kolkata

A-212 (Colaba Campus)

Description

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