Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.
Marc DemangeTínaz EkimPublished in: TAMC (2008)
Keyphrases
- bipartite graph
- maximum weight
- maximum matching
- maximum cardinality
- np hard
- bipartite graph matching
- minimum weight
- minimum cost
- special case
- optimal solution
- link prediction
- scheduling problem
- graph matching
- stable set
- mutual reinforcement
- greedy heuristic
- graph clustering
- approximation algorithms
- image matching
- hits algorithm
- data sets
- edge weights
- bipartite networks
- matching algorithm
- web documents
- np complete
- worst case