On Covering a Graph Optimally with Induced Subgraphs

Details On Covering a Graph Optimally with Induced Subgraphs On Covering a Graph Optimally with Induced Subgraphs

2006-04-06

arxiv.org/abs/cs/0604013v2

Computer Science

Discrete Mathematics

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Covering a Graph Optimally with Induced Subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Covering a Graph Optimally with Induced Subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Covering a Graph Optimally with Induced Subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721096