MinDA problem instances
Published: 15 June 2019| Version 1 | DOI: 10.17632/vy5ckcg38k.1
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.
Graph Theory, Graph Labeling, Facility Layout