Fig. 11From: Heuristic algorithms for best match graph editingPerformance comparison of several beBMG editing heuristics based on the no. of arc differences. See Fig. 7 for further description. Example plot for \(|V|=30\) vertices and \(|\sigma (V)|=10\) colors in each digraph, 100 digraphs per rowBack to article page