Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.
Andrzej CzygrinowMichal HanckowiakEdyta SzymanskaPublished in: ISAAC (2009)
Keyphrases
- maximum matching
- bipartite graph
- dynamic programming
- computational complexity
- learning algorithm
- k means
- optimal solution
- machine learning
- graph isomorphism
- worst case
- graph structure
- linear programming
- expectation maximization
- closed form
- matching algorithm
- detection algorithm
- approximation ratio
- reinforcement learning
- constraint satisfaction
- orders of magnitude
- pairwise
- simulated annealing
- state space
- np hard
- search space