Improved binary linear programming models for finding maximum edge Bi-clique in bipartite graphs
Crossref DOI link: https://doi.org/10.1007/s11227-024-06733-2
Published Online: 2024-12-31
Published Print: 2025-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ghadiri, Mohammad Javad
Bagherian, Mehri
Text and Data Mining valid from 2024-12-31
Version of Record valid from 2024-12-31
Article History
Accepted: 15 November 2024
First Online: 31 December 2024
Declarations
:
: The authors declare that they have no conflict of interest
: Not applicable.