Article citationsMore>>

Grotschel M. and Pulleyblank W. R. (1981) Weakly bipartite graphs and the max-cut problem, Operations Research Letters, 1(23-27), 482.

has been cited by the following article:

• TITLE: Searching maximum quasi-bicliques from protein-protein interaction network

  AUTHORS: Hong-Biao Liu, Juan Liu, Lian Wang

  KEYWORDS: Searching Quasi-Bicliques algorithm; Quasi-biclique; Protein-Protein Interaction Network; Distance-2-Subgraph; Di-vide-and-Conquer method

  JOURNAL NAME: Journal of Biomedical Science and Engineering, Vol.1 No.3, October 17, 2008

  ABSTRACT: Searching the maximum bicliques or bipartite subgraphs in a graph is a tough question. We proposed a new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-bicliques from protein-protein interaction network. As a Divide-and-Conquer method, SQB consists of three steps: first, it divides the protein-protein interaction network into a number of Distance-2-Subgraphs; second, by combining top-down and branch-and-bound methods, SQB seeks quasi-bicliques from every Distance-2-Subgraph; third, all the redundant results are removed. We successfully applied our method on the Saccharomyces cerevisiae dataset and obtained 2754 distinct quasi-bicliques.