Sign in
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
Published in:
SPAA (2019)
Keyphrases
</>
maximum flow
maximum cardinality
push relabel
bipartite graph
computational complexity
minimum cut
graph matching
directed graph
polynomial time complexity
linear programming
undirected graph
randomized algorithm
minimum weight
shape matching
endpoints
graph model
optimization problems
worst case
image processing