Abstract
A co-biclique of a simple undirected graph G = (V,E) is the edge-set of two disjoint complete subgraphs of G . (A co-biclique is the complement of a biclique.) A subset F ⊆ E is an independent of G if there is a co-biclique B such that F ⊆ B , otherwise F is a dependent of G . This paper describes the minimal dependents of G . (A minimal dependent is a dependent C such that any proper subset of C is an independent.) It is showed that a minimum-cost dependent set of G can be determined in polynomial time for any nonnegative cost vector $x\in \mathbb Q_+^E$ . Based on this, we obtain a branch-and-cut algorithm for the maximum co-biclique problem which is, given a weight vector $w\in \mathbb Q_+^E$ , to find a co-biclique B of G maximizing w(B) = ∑ e∈B w e .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
