Dynamic Algorithms for Maximum Matching Size.

Soheil Behnezhad

Published in: CoRR (2022)

Keyphrases

computational complexity
graph theory
theoretical analysis
maximum matching
significant improvement
dynamic environments
computationally efficient
learning algorithm
pairwise
computational cost
times faster
bipartite graph