On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite
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.
Create a lesson
Related papers
Mixing Time of the Random-Pair Monte Shuffle
Ilya Mironov
Proper Conflict-Free Coloring on Structured Graph Classes: Bounds, Exact Algorithms, and Hardness
Kamal Santra
An Almost-tight Size Lower Bound for Bounded Treewidth Homomorphism-Distinguishability
Moritz Lichter, Harry Vinall-Smeeth
Searching the Plane in the Segment Visibility Model
Evangelos Kranakis
Metric Testing: A Characterization of One-Sided Testability
Zihan Tan, Theo Teske
Two-Dimensional Search for a Moving Target on Rectangular and Cylindrical Grids
Alexey Lebedev, Vladimir Lebedev, Christian Deppe