Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width.

Guillaume Ducoffe

Published in: IPEC (2021)

Keyphrases

maximum matching
bipartite graph
maximum weight
independent set
maximum clique
stable set
graph properties
graph matching
minimum weight
worst case
graph theoretic
bounded treewidth
link prediction
quasi cliques
maximum independent set
machine learning
bounded degree
graph databases
social networks