Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets.
Kathleen E. HamiltonTravis S. HumblePublished in: Quantum Inf. Process. (2017)
Keyphrases
- bipartite graph
- bipartite graph matching
- set cover
- maximum matching
- network flow
- maximum cardinality
- edge weights
- greedy algorithm
- approximation algorithms
- greedy heuristics
- maximum weight
- minimum weight
- np hard
- greedy heuristic
- stable set
- matching algorithm
- graph matching
- weighted graph
- link prediction
- solution space
- machine learning
- genetic algorithm
- connected components
- convex hull
- evolutionary algorithm
- computational complexity
- objective function
- social networks