The maximum edge biclique problem is NP-complete

Untitled work

(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

Bicliques and Eigenvalues

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

A novel biclustering approach with iterative optimization to analyze gene expression data

Sutheeworapong, S., Ota, M., Ohta, H., & Kinoshita, K. (2012) · Advances and Applications in Bioinformatics and Chemistry · doi:10.2147/aabc.s32622 · Cited by 4

Approximation Algorithms for Biclustering Problems

Wang, L., Lin, Y., & Liu, X. (2008) · SIAM Journal on Computing · doi:10.1137/060664112 · Cited by 4

Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks

Miettinen, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23525-7_3 · Cited by 4

Mining patterns for clustering using unsupervised decision trees

Gutierrez-Rodríguez, A. E., Martínez-Trinidad, J. F., García-Borroto, M., & Carrasco-Ochoa, J. A. (2015) · Intelligent Data Analysis · doi:10.3233/ida-150783 · Cited by 4

Reducing Redundant Information in Search Results Employing Approximation Algorithms

Makris, C. H., Plegas, Y., Stamatiou, Y. C., Stavropoulos, E. C., & Tsakalidis, A. K. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10085-2_22 · Cited by 4

Using Unsupervised Learning for Data-driven Procurement Demand Aggregation

Shaham, E., Westerski, A., Kanagasabai, R., Amudha, N., Ong, S., Wong, J., & Singh, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i17.17781 · Cited by 4

On computing large temporal (unilateral) connected components

Costa, I. L., Lopes, R., Marino, A., & Silva, A. (2024) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2024.103548 · Cited by 4

On Set Covering Based on Biclustering

Panteli, A., Boutsinas, B., & Giannikos, I. (2014) · International Journal of Information Technology & Decision Making · doi:10.1142/s0219622014500692 · Cited by 4

Bicolored independent sets and bicliques

Couturier, J.-F., & Kratsch, D. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.01.010 · Cited by 4

Fractional minimal rank

Großmann, B., & Woerdeman, H. J. (2018) · Linear and Multilinear Algebra · doi:10.1080/03081087.2018.1466863 · Cited by 4

A Maximum Matching Algorithm for Basis Selection in Spectral LearningPreprint

Quattoni, A., Carreras, X., & Gallé, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.02857 · Cited by 4

Bipartite Graph Analytics: Current Techniques and Future Trends

Wang, H.-C., Wang, K., Zhang, W.-J., & Zhang, Y. (2024) · IEEE International Conference on Data Engineering · doi:10.1109/icde60146.2024.00405 · Cited by 2

Mining Biological Interaction Networks Using Weighted Quasi-Bicliques

Chang, W.-C., Vakati, S. R., Krause, R., & Eulenstein, O. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21260-4_40 · Cited by 3

DeMoS: dense module based gene signature detection through quasi-clique: an application to cervical cancer prognosis

Saha, S. G., Seth, S., Ghosh, S., Qin, G., Bhadra, T., Pati, S. K., Chakraborty, S., & Mallik, S. (2024) · Network Modeling Analysis in Health Informatics and Bioinformatics · doi:10.1007/s13721-024-00470-5 · Cited by 3

On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion

Aravind, N. R., Sandeep, R. B., & Sivadasan, N. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13524-3_3 · Cited by 3

A Pattern-Mining Method for High-Throughput Lab-on-a-Chip Data Analysis

Yoon, S., Luca Benini, C., & DeMicheli, G. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.855960 · Cited by 3

Identifying similar-bicliques in bipartite graphs

Yao, K. L., Chang, L., & Yu, J. X. (2024) · The VLDB Journal · doi:10.1007/s00778-023-00834-9 · Cited by 3

On Polynomial Kernelization of $$\mathcal {H}$$ H -free Edge Deletion

Aravind, N. R., Sandeep, R. B., & Sivadasan, N. (2016) · Algorithmica · doi:10.1007/s00453-016-0215-y · Cited by 3

Detecting Bicliques in GF[q]

Ramon, J., Miettinen, P., & Vreeken, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40988-2_33 · Cited by 3

Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems

Hochbaum, D. S., & Levin, A. (2013) · ACM Transactions on Algorithms · doi:10.1145/2438645.2438651 · Cited by 3

A linear programming formulation for the maximum complete multipartite subgraph problem

Cornaz, D. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0656-6 · Cited by 3

Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables

Shang, Z., Zhao, S., Hao, J., Yang, X., & Ma, F. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2018.10.009 · Cited by 3

Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach

Derval, G., & Schaus, P. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.06.008 · Cited by 3

Rank Reduction of Directed Graphs by Vertex and Edge Deletions

Meesum, S. M., & Saurabh, S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49529-2_46 · Cited by 3

Compressing arrays by ordering attribute values

Owen Kaser, B. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.08.003 · Cited by 3

A formal approach to the role mining problem

Guo, Q. (2010) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t34749nh · Cited by 3

Enumerating Maximal Bicliques from a Large Graph using MapReducePreprint

Mukherjee, A. P., & Tirthapura, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.4910 · Cited by 3

Finding approximately rank-one submatrices with the nuclear norm and l1 normPreprint

Doan, X. V., & Vavasis, S. A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.1839 · Cited by 3

Convex relaxation for the planted clique, biclique, and clustering problems

Ames, B. (2011) · UWSpace (University of Waterloo) · Cited by 3

Six Million (Suspected) Fake Stars on GitHub: A Growing Spiral of Popularity Contests, Spams, and Malware

He, H., Yang, H., Burckhardt, P., Kapravelos, A., Vasilescu, B., & Kästner, C. (2026) · Proceedings of the 2026 IEEE/ACM 48th International Conference on Software Engineering · doi:10.1145/3744916.3764531 · Cited by 28

Research on multiple enhanced k combination reverse Skyline query method

Li, S., Zhang, X., & Zhang, L. (2025) · Journal Of Big Data · doi:10.1186/s40537-025-01076-y · Cited by 2

A biclustering algorithm with coherent evolution on the contiguous columns facing time-series gene data

Xue, Y., Li, M., Liao, Z., Luo, J., Li, T., Xiao, H., & Hu, X. (2014) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2014.6980855 · Cited by 2

An Optimized MBE Algorithm on Sparse Bipartite Graphs

He, Y., Li, R.-H., & Mao, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05755-8_21 · Cited by 2

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices

Průša, D., & Wehar, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-48516-0_20 · Cited by 2

High capacity NP-Complete problems solver based on dual-comb asynchronous optical sampling

Hou, Y., Zhao, X. M., Li, T., Chen, J., Li, Q., Li, Y., & Zheng, Z. (2023) · Optics Communications · doi:10.1016/j.optcom.2023.130021 · Cited by 2

BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs

Ye, J., Zou, Z., Liu, D., Yang, B., & Liu, X. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3709666 · Cited by 2

Approximation Algorithms for Bi-clustering Problems

Wang, L., Lin, Y., & Liu, X. (2006) · Lecture notes in computer science · doi:10.1007/11851561_29 · Cited by 2

Finding Additive Biclusters with Random Background

Xiao, J., Wang, L., Liu, X., & Jiang, T. (2008) · Springer eBooks · doi:10.1007/978-3-540-69068-9_25 · Cited by 2

High-Performance Computing for Data Analytics

Perrin, D., Bezbradica, M., Crane, M., Ruskin, H. J., & Duhamel, C. D. (2012) · International Symposium on Distributed Simulation and Real Time Applications (DS-RT) · doi:10.1109/ds-rt.2012.41 · Cited by 2

Cross-layer mobility-aware MAC protocol for cognitive radio sensor network

Zareei, M., Islam, A. K. M. M., Mansoor, N., Baharun, S., Mohamed, E. M., & Sampei, S. (2015) · International Conference on Informatics, Electronics & Vision (ICIEV) · doi:10.1109/iciev.2015.7334039 · Cited by 2

Parameterized Algorithms for Maximum Edge Biclique and Related Problems

Feng, Q., Zhou, Z., & Wang, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39817-4_8 · Cited by 2

Traffic Adaptive Synchronized Cluster Based MAC Protocol for Cognitive Radio Ad Hoc Network

Sultana, S., Hossain, A., Rahman, M. O., & Jusoh, M. (2017) · MATEC Web of Conferences · doi:10.1051/matecconf/201714001011 · Cited by 2

Biclustering by Resampling

Nosova, E., Tagliaferri, R., Masulli, F., & Stefano Rovetta, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21946-7_12 · Cited by 2

Topological Bounds for Graph Representations over Any Field

Alishahi, M., & Meunier, F. (2021) · SIAM Journal on Discrete Mathematics · doi:10.1137/19m1295921 · Cited by 2

Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper

Groshaus, M., Guedes, A., & Kolberg, F. S. (2019) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2019.08.044 · Cited by 2

Inferring regulatory networks from multiple sources of genomic data

Yeang, C., & Jaakkola, T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2

Scheduling Dags under UncertaintyPreprint

Malewicz, G. G. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.1876 · Cited by 2

Efficiently Mining Maximal 1-complete Regions from Dense Datasets

Bian, H., & Bhatnagar, R. (2006) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2006.69 · Cited by 2

Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering

Maxwell, E. K. (2010) · VTechWorks (Virginia Tech) · Cited by 2

Discovering and summarizing email conversations

Zhou, X. (2008) · cIRcle (University of British Columbia) · doi:10.14288/1.0051392 · Cited by 2

BICLIQUE COMPLETION PROBLEM: MODELS AND ALGORITHMS

Maffioli, F., & Gualandi, S. (2009) · Cited by 2

CSS Minification via Constraint Solving (Technical Report)Preprint

Hague, M., Lin, A. W., & Hong, C.-D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.02989 · Cited by 2

Structural properties of biclique graphs and the distance formulaPreprint

Groshaus, M., & Montero, L. P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.09686 · Cited by 2

Binary Matrix Factorisation and Completion via Integer ProgrammingPreprint

Kovacs, R. A., Günlük, O., & Hauser, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.13434 · Cited by 2

Data Mining Using the Crossing Minimization Paradigm

Abdullah, A. (2007) · Stirling Online Research Repository (University of Stirling) · Cited by 2

Using associators to generate ensemble biclustering from multiple evolved biclusterings

Kim, E.-Y., & Ashlock, D. (2014) · IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB) · doi:10.1109/cibcb.2014.6845530 · Cited by 1

Discovery of bidirectional contiguous column coherent bicluster in time-series gene expression data

Xue, Y., Ma, Z., Xu, H., Lü, Z., Hu, X., & Pang, C. (2015) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-015-0464-0 · Cited by 1

Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs

Zhou, H., Liu, S., & Cao, R. (2024) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010009 · Cited by 1

Maximum Butterfly Generators Search in Bipartite Networks

Huang, J., Pang, G., & Hao, F. (2024) · Mathematics · doi:10.3390/math13010088 · Cited by 1

Efficient set-theoretic algorithms for computing high-order Forman-Ricci curvature on abstract simplicial complexes

de Souza, D. B., Teodomiro, J., Santos, F. A. N., Jost, J., & Rodrigues, S. (2025) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2024.0364 · Cited by 1

Identifying Maximum Defective Bicliques in Large Bipartite Graphs

Wang, Z., Chang, L., & Yu, J. X. (2025) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65448.2025.00277 · Cited by 1

TopK-BC: Efficient Maintenance of Top k (p,q)-bicliques over Streaming Bipartite Graphs

Deng, X., Qin, Z., Peng, P., & Zhou, H. (2025) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65448.2025.00276 · Cited by 1

An Effective Biclustering Algorithm for Time-Series Gene Expression Data

Xu, H., Xue, Y., Lü, Z., Hu, X., Zhao, H., Liao, Z., & Li, T. (2014) · Communications in computer and information science · doi:10.1007/978-3-662-45652-1_12 · Cited by 1

A hybrid mapping algorithm for reconfigurable nanoarchitectures

Al-Mutairi, H. K., & Ahmad, I. (2015) · Journal of Engineering Research · doi:10.7603/s40632-015-0004-9 · Cited by 1

Heuristic approaches for time-lagged biclustering

Gonçalves, J. P., & Madeira, S. C. (2013) · doi:10.1145/2500863.2500865 · Cited by 1

A novel algorithm for enumerating maximal bicliques from a symmetric matrix

Savio, M. R. D., Sankar, A., & Nataraj, R. V. (2012) · International Conference on Emerging Applications of Information Technology · doi:10.1109/eait.2012.6407897 · Cited by 1

Reducing Rank of the Adjacency Matrix by Graph Modification

Meesum, S. M., Misra, P., & Saurabh, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21398-9_29 · Cited by 1

On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering.

Phillips, C., Jay, J. J., Baker, E. J., Chesler, E. J., & Langston, M. A. (2012) · Cologne Twente Workshop on Graphs and Combinatorial Optimization · Cited by 1

Biclustering Evolutionary Spatiotemporal Community in Global Trading Network

Yan, L., Chen, Z., & Zang, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-68542-7_50 · Cited by 1

An algorithm for maximal bicliques searching in dynamic relationship graph

Zhang, S., Liao, M., Xiao, Q., Hou, X., & Lv, P. (2018) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda.2018.8386510 · Cited by 1

Solving Biclustering with a GRASP-Like Metaheuristic: Two Case-Studies on Gene Expression Analysis

Facchiano, A. M., Festa, P., Marabotti, A., Milanesi, L., & Musacchia, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35686-5_21 · Cited by 1

Scalable Graph Algorithms with Applications in Genetics

Zhang, Y. (2008) · Cited by 1

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

Eguía, M., & Soulignac, F. J. (2013) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.626 · Cited by 1

An intelligent technique for pattern-based clustering of continuous-valued datasets

Dhull, A., Singh, A., & Singh, K. K. (2022) · Cluster Computing · doi:10.1007/s10586-022-03553-y · Cited by 1

A PATTERN-MINING METHOD FOR HIGH-THROUGHPUT LAB-ON-A-CHIP DATA ANALYSIS

Yoon, S., Luca Benini, C., & Micheli, G. D. (2006) · Springer eBooks · doi:10.1007/1-4020-5123-9_14 · Cited by 1

The Bipartite QUBO

Punnen, A. P. (2022) · Springer eBooks · doi:10.1007/978-3-031-04520-2_10 · Cited by 1

Binary Matrix Factorization and Completion via Integer Programming

Günlük, O., Hauser, R., & Kovács, R. Á. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2023.1386 · Cited by 1

Semidefinite Approximations for Bicliques and Bi-Independent Pairs

Laurent, M., Polak, S. C., & Vargas, L. F. (2024) · Mathematics of Operations Research · doi:10.1287/moor.2023.0046 · Cited by 1

Improved binary linear programming models for finding maximum edge Bi-clique in bipartite graphs

Ghadiri, M. J., & Bagherian, M. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06733-2 · Cited by 1

Applying Power Graph Analysis to Weighted Graphs

Bloom, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28997-2_61 · Cited by 1

Co-clustering of fuzzy lagged data

Shaham, E., Sarne, D., & Moshe, B. B. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-014-0758-7 · Cited by 1

Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs

Konagaya, M., Otachi, Y., & Uehara, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06089-7_15 · Cited by 1

Umedicine: A System for Clinical Practice Support and Data Analysis

Lages, N., Caetano, B., Fonseca, M. J., Pereira, J. D., Galhardas, H., & Farinha, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67186-4_9 · Cited by 1

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions

Meesum, S. M., & Saurabh, S. (2017) · Algorithmica · doi:10.1007/s00453-017-0340-2 · Cited by 1

Faster Biclique Mining in Near-Bipartite Graphs

Sullivan, B. D., van der Poel, A., & Woodlief, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34029-2_28 · Cited by 1

Computing the Proportional Veto Core

Ianovski, E., & Kondratev, A. Y. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i6.16691 · Cited by 1

An Intelligent Technique to Find Bicliques and its Application to Optimum Matching Problem

Sarkar, P., & Giri, K. (2020) · International Conference on Emerging Trends in Information Technology and Engineering (ICETITE) · doi:10.1109/ic-etite47903.2020.61 · Cited by 1

Combinatorics and Algorithms for Quasi-chain Graphs

Alecu, B., Atminas, A., Lozin, V., & Malyshev, D. S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-79987-8_4 · Cited by 1

On the generation of bicliques of a graph

Dias, V. M. F., de Figueiredo, C. M. H., & SZWARCFITER, J. L. (2004) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2004.03.025 · Cited by 1

Multi-layered model of individual HIV infection progression and mechanisms of phenotypical expression

Perrin, D. (2008) · Dublin City University Open Access Institutional Repository (Dublin City University) · Cited by 1

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics

Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2010) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2010.05.021 · Cited by 1

Biclustering of Gene Expression Data Based on Bucketing Technique

Liu, F., & Zhou, H. (2007) · International Conference on Bioinformatics and Biomedical Engineering · doi:10.1109/icbbe.2007.95 · Cited by 1

Identifying Evolutionarily Conserved Protein Interaction Networks

Rivera, C. G. (2005) · VTechWorks (Virginia Tech) · Cited by 1

Multi-Document Summarization and Semantic Relatedness

Mogren, O. (2015) · Chalmers Publication Library (Chalmers University of Technology) · Cited by 1

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms with Applications to Fraud DetectionPreprint

Ban, Y., Duan, Y., & Huang, L. (2018) · arXiv (Cornell University) · Cited by 1

Memory Access Efficiency in Distributed Atomic Object Implementations

Hadjistasi, T. (2019) · OpenCommons at University of Connecticut (University of Connecticut) · Cited by 1

Bi-objective Optimization of Biclustering with Binary DataPreprint

Glover, F., Hanafi, S., & Palubeckis, G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04711 · Cited by 1

On incremental maintenance of 2-hop labeling of graphs

Bramandia, R. (2009) · doi:10.32657/10356/42234 · Cited by 1

Profit or Planet? Both! ESG Drivers of Efficient Portfolios and the Costs of DisclosurePreprint

Rosamilia, N. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.5078171 · Cited by 1

Méthodes combinatoires de reconstruction de réseaux phylogénétiques

Gambette, P. (2010) · doi:10.70675/b4f71614z4edbz4b4bzb9c9z18ac5e7c8816 · Cited by 1

Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming

Sözdinler, M., & Özturan, C. (2018) · IEEE International Conference on Computational Science and Engineering (CSE) · doi:10.1109/cse.2018.00025 · Cited by 15

Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Chen, H., & Liu, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59605-1_5 · Cited by 6

On bipartite and multipartite . . .

Dawande, M., Keskinocak, P., Swaminathan, J. M., & Tayur, S. (2000)

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

NussbaumDoron, PuShuye, SackJörg-Rüdiger, UnoTakeaki, & Zarrabi-ZadehHamid (2012) · Algorithmica · doi:10.5555/3118237.3118545 · Cited by 1

Maximizing edge-ratio is NP-complete

Noble, S. D., Hansen, P., & Mladenović, N. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.07.016 · Cited by 2