On Covering a Graph Optimally with Induced Subgraphs

Simple item page
dc.creatorThite, Shripad
dc.date2006-04-06
dc.date2006-04-07
dc.date.accessioned2026-07-07T07:09:19Z
dc.date.available2026-07-07T07:09:19Z
dc.descriptionWe 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/cs/0604013
dc.identifierhttp://arxiv.org/abs/cs/0604013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111018
dc.subjectDiscrete Mathematics
dc.titleOn Covering a Graph Optimally with Induced Subgraphs
dc.typetext

Files

Collections

arXiv