-path vertex cover in Cartesian product graphs and complete bipartite graphs.
Zhao LiLiancui ZuoPublished in: Appl. Math. Comput. (2018)
Keyphrases
- bipartite graph
- cartesian product
- vertex cover
- planar graphs
- approximation algorithms
- maximum cardinality
- edge weights
- minimum weight
- graph clustering
- maximum matching
- partial order
- link prediction
- precedence constraints
- collaborative filtering
- supervised learning
- dynamic programming
- np hard
- optimality criterion
- search algorithm
- objective function
- reinforcement learning