Maximum Edge Bicliques in Tree Convex Bipartite Graphs

  • Hao Chen
  • Tian LiuEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10336)


We show that the computational complexity of the maximum edge biclique (MEB) problem in tree convex bipartite graphs depends on the associated trees. That is, MEB is \(\mathcal {NP}\)-complete for star convex bipartite graphs, but polynomial time solvable for tree convex bipartite graphs whose associated trees have a constant number of leaves. In particular, MEB is polynomial time solvable for triad convex bipartite graphs. Moreover, we show that the same algorithm strategy may not work for circular convex bipartite graphs, and triad convex bipartite graphs are incomparable with respect to chordal bipartite graphs.


Maximum edge biclique Tree convex bipartite graphs Star convex bipartite graphs Triad convex bipartite graphs \(\mathcal {NP}\)-completeness Polynomial-time 



We thank the unknown reviewers whose comments are helpful to improve our presentations.


  1. 1.
    Acuña, V., Ferreira, C.E., Freire, A.S., Moreno, E.: Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discret. Appl. Math. 164, 2–12 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11–21 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability resullts for maximum edge biclique, minimum linear arrangement, and sparse cut. SIAM J. Comput. 40(2), 567–596 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Brandstad, A., Le, V.B., Spinrad, J.P.: Graph Classes - A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)CrossRefGoogle Scholar
  5. 5.
    Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Xu, K.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32(1), 95–110 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41, 388–403 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theoret. Comput. Sci. 337(1C3), 240–248 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discret. Appl. Math. 155(14), 1826–1832 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of STOC 2002, pp. 534–543 (2002)Google Scholar
  10. 10.
    Gély, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discret. Appl. Math. 157(7), 1447–1459 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gillis, N., Glineur, F.: A continuous characterization of the maximum edge biclique problem. J. Glob. Optim. 58, 439–464 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Goerdt, A., Lanka, A.: An approximation hardness result for bipartite clique. Electronic Colloquium on Computation Complexity TR2004-048 (2004)Google Scholar
  13. 13.
    Grover, F.: Maximum matching in a convex bipartite graph. Nav. Res. Logist. Q. 14, 313–316 (1967)CrossRefGoogle Scholar
  14. 14.
    Jiang, W., Liu, T., Ren, T., Xu, K.: Two hardness results on feedback vertex sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 233–243. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-21204-8_26 CrossRefGoogle Scholar
  15. 15.
    Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theoret. Comput. Sci. 507, 41–51 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Jiang, W., Liu, T., Xu, K.: Tractable feedback vertex sets in restricted bipartite graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 424–434. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-22616-8_33 CrossRefGoogle Scholar
  17. 17.
    Liang, Y.D., Blum, N.: Circular convex bipartite graphs: maximum matching and Hamiltonian circuits. Inf. Process. Lett. 56, 215–219 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Liu, T.: Restricted bipartite graphs: comparison and hardness results. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 241–252. Springer, Cham (2014). doi: 10.1007/978-3-319-07956-1_22 Google Scholar
  19. 19.
    Liu, T., Lu, M., Lu, Z., Xu, K.: Circular convex bipartitegraphs: feedback vertex sets. Theoret. Comput. Sci. 556, 55–62 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Liu, T., Lu, Z., Xu, K.: Tractable connected domination for restricted bipartite graphs. J. Comb. Optim. 29(1), 247–256 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Liu, T., Xu, K.: Union closed tree convex sets. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 198–203. Springer, Cham (2015). doi: 10.1007/978-3-319-19647-3_19 CrossRefGoogle Scholar
  22. 22.
    Lu, M., Liu, T., Xu, K.: Independent domination: reductions from circular- and triad-convex bipartite graphs to convex bipartite graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM/FAW -2013. LNCS, vol. 7924, pp. 142–152. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-38756-2_16 CrossRefGoogle Scholar
  23. 23.
    Lu, M., Liu, T., Tong, W., Lin, G., Xu, K.: Set cover, set packing and hitting set for tree convex and tree-like set systems. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 248–258. Springer, Cham (2014). doi: 10.1007/978-3-319-06089-7_17 CrossRefGoogle Scholar
  24. 24.
    Lu, Z., Liu, T., Xu, K.: Tractable connected domination for restricted bipartite graphs (extended abstract). In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 721–728. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-38768-5_65 CrossRefGoogle Scholar
  25. 25.
    Lu, Z., Lu, M., Liu, T., Xu, K.: Circular convex bipartite graphs: feedback vertex set. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 272–283. Springer, Cham (2013). doi: 10.1007/978-3-319-03780-6_24 CrossRefGoogle Scholar
  26. 26.
    Nussbaum, D., Pu, S., Sack, J., Uno, T., Zarrabi-Zadeh, H.: Finding maximum edge bicliques in convex bipartite graphs. Algorithmica 64, 311–325 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Peeters, R.: The maximum edge biclique problem is NP-complete. Discret. Appl. Math. 131, 651–654 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Pandey, A., Panda, B.S.: Domination in some subclasses of bipartite graphs. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 169–180. Springer, Cham (2015). doi: 10.1007/978-3-319-14974-5_17 Google Scholar
  29. 29.
    Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM/FAW -2012. LNCS, vol. 7285, pp. 129–138. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-29700-7_12 CrossRefGoogle Scholar
  30. 30.
    Wang, C., Chen, H., Lei, Z., Tang, Z., Liu, T., Xu, K.: Tree convex bipartite graphs: \(\cal{NP}\)-complete domination, hamiltonicity and treewidth. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 252–263. Springer, Cham (2014). doi: 10.1007/978-3-319-08016-1_23 CrossRefGoogle Scholar
  31. 31.
    Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback Vertex Sets on Tree Convex Bipartite Graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 95–102. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-31770-5_9 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Key Laboratory of High Confidence Software Technologies (MOE), Institute of Software, School of Electronic Engineering and Computer SciencePeking UniversityBeijingChina

Personalised recommendations