Login / Signup
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs.
Vahan Mkrtchyan
Garik Petrosyan
Published in:
J. Graph Algorithms Appl. (2022)
Keyphrases
</>
bipartite graph
bipartite graph matching
vertex cover
maximum matching
maximum weight
edge weights
maximum cardinality
planar graphs
approximation algorithms
minimum weight
partial order
weighted graph
link prediction
polynomial time approximation
precedence constraints
machine learning
reinforcement learning