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

David Eppstein Vijay V. Vazirani

Published in: SIAM J. Comput. (2021)

Keyphrases

maximum flow
push relabel
maximum cardinality
graph theory
minimum cut
graph matching
directed graph
optimization problems
social networks
computer vision
active contours
shape matching