Skip to main content
SpringerLink
Log in

Hitting All Maximal Independent Sets of a Bipartite Graph

  • Published:
Algorithmica Aims and scope Submit manuscript

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 at most k hitting all maximal independent sets of G is complete for the class \(\varSigma_{2}^{\mathrm{P}}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Aigner, M., Andreae, T.: Vertex sets that meet all maximal cliques of a graph. Manuscript (1986)

  2. Andreae, T.: On the clique-transversal number of chordal graphs. Discrete Math. 191(1–3), 3–11 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Andreae, T., Schughart, M., Tuza, Z.: Clique-transversal sets of line graphs and complements of line graphs. Discrete Math. 88(1), 11–20 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bacsó, G., Gravier, S., Gyárfás, A., Preissmann, M., Sebö, A.: Coloring the maximal cliques of graphs. SIAM J. Discrete Math. 17(3), 361–376 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Balachandran, V., Nagavamsi, P., Rangan, C.P.: Clique transversal and clique independence on comparability graphs. Inf. Process. Lett. 58(4), 181–184 (1996)

    Article  MathSciNet  Google Scholar 

  6. Duffus, D., Kierstead, H.A., Trotter, W.T.: Fibres and ordered set coloring. J. Comb. Theory, Ser. A 58(1), 158–164 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Duffus, D., Sands, B., Sauer, N., Woodrow, R.E.: Two-colouring all two-element maximal antichains. J. Comb. Theory, Ser. A 57(1), 109–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Durán, G., Lin, M.C., Mera, S., Szwarcfiter, J.L.: Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157(1), 37–45 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Durán, G., Lin, M.C., Szwarcfiter, J.L.: On clique-transversals and clique-independent sets. Ann. Oper. Res. 116(1–4), 71–77 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Erdös, P., Gallai, T., Tuza, Z.: Covering the cliques of a graph with vertices. Discrete Math. 108(1–3), 279–289 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302–320 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  12. Guruswami, V., Rangan, C.P.: Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Appl. Math. 100(3), 183–202 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kratochvíl, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1), 40–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lonc, Z., Rival, I.: Chains, antichains, and fibres. J. Comb. Theory, Ser. A 44(2), 207–228 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  15. Marx, D.: Complexity of clique coloring and related problems. Theor. Comput. Sci. 412(29), 3487–3500 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  17. Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: a compendium. In: SIGACT News (2002). Guest Complexity Theory column

    Google Scholar 

  18. Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1–22 (1976)

    Article  MathSciNet  Google Scholar 

  19. Tuza, Z.: Covering all cliques of a graph. Discrete Math. 86(1–3), 117–126 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23–33 (1976)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We thank the anonymous referees for their careful reading of the manuscript and their helpful comments.

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles, Brussels, Belgium

    Jean Cardinal & Gwenaël Joret

Authors
  1. Jean Cardinal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gwenaël Joret
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gwenaël Joret.

Additional information

Gwenaël Joret is a Postdoctoral Researcher of the Fonds National de la Recherche Scientifique (F.R.S.–FNRS).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cardinal, J., Joret, G. Hitting All Maximal Independent Sets of a Bipartite Graph. Algorithmica 72, 359–368 (2015). https://doi.org/10.1007/s00453-013-9847-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-013-9847-3

Keywords

Search

Navigation