On Covering a Graph Optimally with Induced Subgraphs
Discrete Mathematics
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0604013,
title = {On Covering a Graph Optimally with Induced Subgraphs},
author = {Shripad Thite},
journal= {arXiv preprint arXiv:cs/0604013},
year = {2007}
}
Comments
9 pages