The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes.

Guillaume Ducoffe Alexandru Popa

Published in: ISAAC (2018)

Keyphrases

maximum matching
bipartite graph
graph theory
computational complexity
tree decomposition
maximum flow
social networks
data structure
search space
state space
scheduling problem
orders of magnitude
directed graph
equivalence classes
stable set