research

Hitting all Maximal Independent Sets of a Bipartite Graph

Authors
Publication date
27 December 2013
Publisher
'Springer Science and Business Media LLC'
Doi
    View on arXiv

    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.Comment: v3: minor chang

      Similar works

      Full text

      thumbnail-image

      Available Versions

      CiteSeerX

      redirect
      oaioai:CiteSeerX.psu:10.1.1.755.6...
      Last time updated on 30/10/2017

      Crossref

      redirect
      oaiinfo:doi/10.1007%2Fs00453-013-...
      Last time updated on 11/12/2019

      DI-fusion

      redirect
      oaioai:dipot.ulb.ac.be:2013/17271...
      Last time updated on 23/02/2017