MinDA problem instances

Published: 15 Jun 2019 | Version 1 | DOI: 10.17632/vy5ckcg38k.1
Contributor(s):

Description of this data

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.

Experiment data files

Latest version

  • Version 1

    2019-06-15

    Published: 2019-06-15

    DOI: 10.17632/vy5ckcg38k.1

    Cite this dataset

    Amaral, Andre (2019), “MinDA problem instances”, Mendeley Data, v1 http://dx.doi.org/10.17632/vy5ckcg38k.1

Statistics

Views: 9
Downloads: 2

Categories

Graph Theory, Graph Labeling, Facility Layout

Licence

CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?

This dataset is licensed under a Creative Commons Attribution 4.0 International licence. What does this mean? You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.

Report