On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs.
Vahan MkrtchyanGarik PetrosyanPublished in: CoRR (2021)
Keyphrases
- bipartite graph
- vertex cover
- bipartite graph matching
- maximum matching
- edge weights
- maximum weight
- maximum cardinality
- planar graphs
- approximation algorithms
- minimum weight
- weighted graph
- partial order
- link prediction
- undirected graph
- optimality criterion
- np hard
- polynomial time approximation
- optimal solution
- learning algorithm
- machine learning