Fig. 3From: Recovering rearranged cancer chromosomes from karyotype graphsReduction of K3 covering problem to the instance of max-EDP. Transformation of the regular undirected graph G into IAG G′ and back with K3 decomposition in G corresponding to segment-adjacency edge-alternating cycles in G′Back to article page