A special graph convex covering problem
Radu Buzatu
Moldova State University, Chişinău, Moldova
Abstract:
The general graph convex covering problem is known to be NP-complete. We focus on the special kind of this problem, which in some cases is computationally significantly easier. We present recent results and provide several applications of special graph convex covering problem.