The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes.
Guillaume DucoffeAlexandru PopaPublished in: CoRR (2018)
Keyphrases
- maximum matching
- bipartite graph
- graph theory
- learning algorithm
- equivalence classes
- structured data
- stable set
- tree decomposition
- orders of magnitude
- machine learning
- combinatorial optimization
- graphical models
- optimization problems
- evolutionary algorithm
- decomposition methods
- data structure
- training data
- genetic algorithm