Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming

Melih Sözdinler, Can Özturan. Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming. In Florin Pop, Catalin Negru, Horacio González-Vélez, Jacek Rak, editors, 2018 IEEE International Conference on Computational Science and Engineering, CSE 2018, Bucharest, Romania, October 29-31, 2018. pages 132-137, IEEE Computer Society, 2018. [doi]

Authors

Melih Sözdinler

This author has not been identified. Look up 'Melih Sözdinler' in Google

Can Özturan

This author has not been identified. Look up 'Can Özturan' in Google