The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The maximum edge biclique problem is NP-complete
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
On the Shannon capacity of a graph
Lovász, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,658
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 799
Node-and edge-deletion NP-complete problems
Yannakakis, M. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804355 · Cited by 445
Approximating Clique and Biclique Problems
Hochbaum, D. S. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0964 · Cited by 113
The NP-completeness column: An ongoing guide
Johnson, D. S. (1987) · Journal of Algorithms · doi:10.1016/0196-6774(87)90021-6 · Cited by 75
Haemers, W. H. (2001) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.2000.2020 · Cited by 20
Bipartite sandwiches: bounding the size of a maximum bicliquePreprint
Ṗasechnik, D. V. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.math/9907109 · Cited by 3
Bipartite sandwiches: semide?nite relaxations for maximum biclique
Ṗasechnik, D. V. (1999) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(05)80046-0 · Cited by 2
Cited by
Sorted by citations
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
Beutel, A., Xu, W., Guruswami, V., Palow, C., & Faloutsos, C. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488400 · Cited by 335
Vaidya, J. S., Atluri, V., & Guo, Q. (2007) · ACM Symposium on Access Control Models and Technologies (SACMAT) · doi:10.1145/1266840.1266870 · Cited by 294
Multi-objective evolutionary biclustering of gene expression data
Mitra, S., & Banka, H. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.03.003 · Cited by 250
Metadata
- Authors
- Peeters, R.
- Affiliations
- Tilburg University (NL)
- Corresponding author
- Peeters, René
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 2003-09
- Volume
- 131
- Issue
- 3
- Pages
- 651-654
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W2150718242
- Cited by
- 374
- References
- 9
- Citations by year
- 2026: 7 · 2025: 11 · 2024: 12 · 2023: 14 · 2022: 13 · 2021: 17 · 2020: 15 · 2019: 15 · 2018: 14 · 2017: 15 · 2016: 16 · 2015: 17 · 2014: 29 · 2013: 22 · 2012: 22
- FWCI
- 15.81
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Discrete Applied Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Keywords
- bipartite graphs, NP-completeness, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
