NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

David Eppstein, Vijay V. Vazirani. NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs. SIAM Journal on Computing, 50(3):1014-1033, 2021. [doi]

Abstract

Abstract is missing.