A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching.
Nima AnariVijay V. VaziraniPublished in: CoRR (2019)
Keyphrases
- learning algorithm
- matching algorithm
- graph based algorithm
- np hard
- preprocessing
- dynamic programming
- expectation maximization
- special case
- computational cost
- optimization algorithm
- shortest path problem
- recognition algorithm
- graph construction
- search space
- computational complexity
- string matching
- matching process
- solution path
- approximate matching
- tree structure
- relaxation algorithm
- polynomial time complexity
- maximum cardinality
- undirected graph
- weighted graph
- graph structure
- directed graph
- pattern matching
- worst case
- probabilistic model
- evolutionary algorithm
- objective function
- similarity measure