Fig. 6From: Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithmsAn illustration of partitioning V(G) into a number of bipartite subgraphs. The input edge-weighted graph is bipartite, i.e., V(G) = V(A)∪V(B) and all edges are linked between disjoint parts A and B, where part A represents miRNAs, with (upper) nodes denoted by squares, and part B represents mRNAs, with (lower) nodes denoted by circlesBack to article page