On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite · arXiv (Cornell University) · 2006
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation algorithms for certain graph classes.