Hitting all Maximal Independent Sets of a Bipartite Graph
classification
💻 cs.CC
cs.DS
keywords
bipartitegraphhittingindependentmaximalsetsclasscomplete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.