Hitting all Maximal Independent Sets of a Bipartite Graph
Computational Complexity
2015-05-12 v3 Data Structures and Algorithms
Abstract
We prove that given a bipartite graph G with vertex set V and an integer k, deciding whether there exists a subset of V of size k hitting all maximal independent sets of G is complete for the class Sigma_2^P.
Keywords
Cite
@article{arxiv.1208.5589,
title = {Hitting all Maximal Independent Sets of a Bipartite Graph},
author = {Jean Cardinal and Gwenaël Joret},
journal= {arXiv preprint arXiv:1208.5589},
year = {2015}
}
Comments
v3: minor change