The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes.

Guillaume Ducoffe Alexandru Popa

Published in: Discret. Appl. Math. (2021)

Keyphrases

maximum matching
graph theory
bipartite graph
learning algorithm
optimization problems
stable set
graph theoretic
genetic algorithm
collaborative filtering
orders of magnitude
directed graph
spanning tree
maximal cliques