Skip to main content
SpringerLink
Log in

Parameterized Algorithms for Maximum Edge Biclique and Related Problems

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9711))

Included in the following conference series:

  • 663 Accesses

Abstract

Maximum Edge Biclique and related problems have wide applications in management science, bioinformatics, etc. In this paper, we study the parameterized algorithms for the Parameterized Edge Biclique problem, the Parameterized Edge Biclique Packing problem, and the Parameterized Biclique Edge Deletion problem. For the Parameterized Edge Biclique problem, the current best result is of running time \(O^*(2^k)\), and we give a parameterized algorithm of running time \(O^*({k^{\lceil \sqrt{k} \rceil }})\). For the Parameterized Edge Biclique Packing problem, based on randomized divide-and-conquer technique, a parameterized algorithm of running time \(O^*(4^{(2k-1)t)}k^{\lceil \sqrt{k} \rceil })\) is given. We study the Parameterized Biclique Edge Deletion problem on bipartite graphs and general graphs, and give parameterized algorithms of running time \(O^*(2^k)\) and \(O^*(3^k)\), respectively.

This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61572414, 61420106009).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Acuna, V., Ferreira, C., Freire, A., Moreno, E.: Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Appl. Math. 164, 2–12 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z., Discovering local structure in gene expression data: the order-preserving submatrix problem. In: Proceedings of 6th Annual International Conference on Computational Biology (RECOMB), pp. 49–57 (2002)

    Google Scholar 

  3. Bodlaender, H., Downey, R., Fellows, M., Hermeliny, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bu, S.: The summarization of hierarchical data with exceptions, Master Thesis, Department of Computer Science, University of British Columbia (2004)

    Google Scholar 

  5. Cheng, Y., Church, G.: Biclustering of expression data. In: Proceedings of 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 93–103 (2000)

    Google Scholar 

  6. Dawande, M., Keskinocak, P., Tayur, S.: On the Biclique Problem in Bipartite Graphs, GSIA working paper, 1996–04 (1996)

    Google Scholar 

  7. Feige, U., Kogan, S.: Hardness of approximation of the balanced complete bipartite subgraph problem, Manuscript (2004)

    Google Scholar 

  8. Hochbaum, D.: Approximating clique and biclique problems. J. Algorithms 29, 174–200 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 448–462. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131(3), 651–654 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Swaminathan, J., Tayur, S.: Managing broader product lines through delayed differentiation using vanilla boxes. Manage. Sci. 44, 161–172 (1998)

    Article  MATH  Google Scholar 

  12. Tan, J.: Inapproximability of maximum weighted edge biclique and its applications. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 282–293. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Tan, J., Chua, K., Zhang, L., Zhu, S.: Algorithmic and complexity issues of three clustering methods in microarray data analysis. Algorithmica 48(2), 203–219 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. Bioinformatics 18, 136–144 (2002)

    Article  Google Scholar 

  15. Zhang, L., Zhu, S.: New clustering method for microarray data analysis. In: Proceedings of 1st IEEE Computer Society Bioinformatics Conference (CSB), pp. 268–275 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, People’s Republic of China

    Qilong Feng, Zeyang Zhou & Jianxin Wang

Authors
  1. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zeyang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qilong Feng .

Editor information

Editors and Affiliations

  1. Shandong University, Jinan, China

    Daming Zhu

  2. MS EC-31, University of Texas at Dallas, Richardson, Texas, USA

    Sergey Bereg

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Feng, Q., Zhou, Z., Wang, J. (2016). Parameterized Algorithms for Maximum Edge Biclique and Related Problems. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39817-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39816-7

  • Online ISBN: 978-3-319-39817-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation