Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult

DOI10.1155/2014/934630zbMath1407.68196OpenAlexW1984334150WikidataQ59070928 ScholiaQ59070928MaRDI QIDQ1719430

Yanyan Mao, Daming Zhu, Peiqiang Liu, Jinjie Xiao, Qingsong Xie

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/934630

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean and Hadamard matrices (15B34)

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum edge biclique problem is NP-complete
• Biclustering in data mining
• Mathematical classification and clustering
• On Bipartite and Multipartite Clique Problems
• Approximation Algorithms for Biclustering Problems
• Complexity and Improved Heuristic Algorithms for Binary Fingerprints Clustering
• The complexity of satisfiability problems

This page was built for publication: Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult