Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.
Sanne WøhlkGilbert LaportePublished in: Comput. Oper. Res. (2017)
Keyphrases
- minimum cost
- greedy algorithms
- spanning tree
- greedy algorithm
- graph matching
- undirected graph
- np hard
- network flow
- approximation algorithms
- network flow problem
- approximation ratio
- matching algorithm
- subgraph isomorphism
- pattern matching
- capacity constraints
- knapsack problem
- directed graph
- edit operations
- minimum cost flow
- genetic algorithm
- image matching
- search algorithm
- bipartite graph
- string matching
- graph mining
- graph structure
- worst case
- evolutionary algorithm
- optimal solution