NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs.

David Eppstein, Vijay V. Vazirani

Browse the full SPAA paper archive.