A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs.

Megha Khosla Avishek Anand

Published in: CoRR (2016)

Keyphrases

dynamic programming
computational complexity
bipartite matching
search space
np hard
simulated annealing
data objects
genetic algorithm
objective function
worst case
undirected graph
minimum cost flow