The maximum edge biclique problem is NP-complete-Reference-Cited by-同舟云学术

The maximum edge biclique problem is NP-complete

Published:2003-09 Issue:3 Volume:131 Page:651-654
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Peeters René

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference8 articles.

1. M. Dawande, P. Keskinocak, S. Tayur, On the biclique problem in bipartite graphs, GSIA Working Paper 1996-04, Carnegie Mellon University, Pittsburgh, PA 15213, USA, 1996.

2. Computers and Intractability, A Guide to the Theory of NP-Completeness;Garey,1979

3. Bicliques and eigenvalues;Haemers;J. Combin. Theory B,2001

4. Approximating clique and biclique problems;Hochbaum;J. Algorithms,1998

5. The NP-completeness column;Johnson;J. Algorithms,1987

Cited by 222 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On computing large temporal (unilateral) connected components;Journal of Computer and System Sciences;2024-09

2. DeMoS: dense module based gene signature detection through quasi-clique: an application to cervical cancer prognosis;Network Modeling Analysis in Health Informatics and Bioinformatics;2024-07-03

3. Efficient Index for Temporal Core Queries over Bipartite Graphs;Proceedings of the VLDB Endowment;2024-07

4. Bipartite Graph Analytics: Current Techniques and Future Trends;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Semidefinite Approximations for Bicliques and Bi-Independent Pairs;Mathematics of Operations Research;2024-03-13