MinDA problem instances

These are 72 instances of the minimum duplex arrangement (MinDA) problem. Let G (V, E) be a graph with vertex set V and edge set E. The format of each instance is as follows: -------- n m u_1 v_1 u_2 v_2 . . . u_m v_m -------- Where: n=|V|; m=|E|; (u_i , v_i ) is an edge in E. MinDA and its instances were introduced in: A. R. S. Amaral (2011) On duplex arrangement of vertices. Technical report, Graduate School of Computer Science, Federal University of Espirito Santo -UFES, Brazil.本数据集共包含72个最小双工排列（Minimum Duplex Arrangement, MinDA）问题实例。设G(V, E)为顶点集为V、边集为E的图。每个实例的格式如下： -------- n m u₁ v₁ u₂ v₂ . . . uₘ vₘ -------- 其中：n为顶点数|V|；m为边数|E|；(uᵢ, vᵢ)为边集E中的一条边。 MinDA及其相关实例由A. R. S. Amaral于2011年在技术报告《顶点的双工排列》（On duplex arrangement of vertices）中提出，依托单位为巴西圣埃斯皮里图联邦大学（UFES）计算机科学研究生院。