A DFS Algorithm for Maximum Matchings in General Graphs.
Tony T. LeeBojun LuHanli ChuPublished in: CoRR (2022)
Keyphrases
- experimental evaluation
- times faster
- learning algorithm
- preprocessing
- matching algorithm
- cost function
- detection algorithm
- optimization algorithm
- optimal solution
- depth first search
- random graphs
- minimum spanning tree
- spanning tree
- expectation maximization
- high accuracy
- probabilistic model
- dynamic programming
- np hard
- special case
- significant improvement
- k means
- computational cost
- segmentation algorithm
- recognition algorithm
- search space
- computational complexity
- search algorithm