Campus Event Calendar
Event Entry
What and Who
Counting the number of perfect matchings in K5-free graphs
Thomas Thierauf
Aalen University
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Expert Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 26 March 2014
11:30
60 Minutes
E2 1 - Bioinformatik
001
Saarbrücken
Abstract
We show that the number of perfect matchings in K5-free graphs can be computed in polynomial time.
Contact
Markus Bläser
--email hidden
passcode not visible
logged in users only
Christine Kiesel, 03/19/2014 16:45
Christine Kiesel, 03/19/2014 16:36 -- Created document.
Christine Kiesel, 03/19/2014 16:36 -- Created document.