Event-Driven Support of Real-Time Sentient Objects

Perfect matchings of k-Pfaffian graphs may be enu- merated in polynomial time on the number of vertices, for fixed k.. In general, this enumeration problem is