An exact algorithm for finding k-biclique vertex partitions of bipartites
Peiqiang Liu
Abstract
Peiqiang Liu
Abstract
The content formerly presented as the proceedings of this conference in IEEE Xplore was found to be unauthorized, and thus a wholly inaccurate representation of the proceedings of the conference.The content now presented as the proceedings of this conference has been verified as a true and accurate representation of the research presented at the conference. We apologize for this incident, and have taken steps to prevent this from happening in the future.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The content formerly presented as the proceedings of this conference in IEEE Xplore was found to be unauthorized, and thus a wholly inaccurate representation of the proceedings of the conference.The content now presented as the proceedings of this conference has been verified as a true and accurate representation of the research presented at the conference. We apologize for this incident, and have taken steps to prevent this from happening in the future.
Key concepts: Bipartite graph, Complete bipartite graph, Vertex (graph theory), Partition (number theory), Algorithm, Combinatorics, Biclustering, Computer science