Skip to main content

Advertisement

Fig. 7 | BMC Medical Genomics

Fig. 7

From: Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithms

Fig. 7

Tiny example of matching algorithms. Squares or circles are vertices. The numbers are edge weights. Green edges are edges in the maximum matching. Black edges are edges that are not in the maximum matching. (A): Hungarian algorithm that finds maximum edge-weighted matchings in a bipartite graph. (B): Blossom algorithm that finds maximum edge-weighted matchings in a general graph. The figure is adapted from https://www-m9.ma.tum.de/graph-algorithms/matchings-hungarian-method/index_en.html and http://jorisvr.nl/article/maximum-matching

Back to article page