pace-challenge / minimum-fill-in-pace-2017-instances

instances for Track B of PACE 2017

Minimum-Fill-In Challenge PACE 2017 instances

These instances were used in Track B of The Second Parameterized Algorithms and Computational Experiments Challenge (PACE 2017). The aim of this track was to compute a minimum-fill-in of the given graph. A fill-in is a set of edges whose insertion makes the input graph chordal. A chordal graph is a graph that contains no cycle of length at least four as induced subgraph. Half of the instances were made public before the challenge and the other half remained hidden until the conclusion of the challenge. Details can be found in the official PACE 2017 report.

File Format

Each .graph-file contains a list of vertex-pairs, constituting an undirected edge. Each line corresponds to one edge. The vertices of the edge are separated by a whitespace. Vertex ids are integers of value at least 1. Lines starting with '#' are comments.

minimum-fill-in-pace-2017-instances's Issues

repository documentation, README, and name

Thanks for publishing the instances here!

See this repository for a possible template: https://github.com/PACE-challenge/Treewidth-PACE-2017-instances

Could you please:

• (important) add a LICENSE file
• add a link to the report (and/or the website) to the README file, and briefly mention the name of the problem that was solved.
• briefly explain the file format (do vertex names start at 0 or 1? etc) or link to a page that does.
• rename the repository consistent with other repositories at https://github.com/PACE-challenge, so either "problemname" (if this is meant to be a central hub also for future updates) or something that follows the pattern [problemname]-PACE-2017-instances (if this is just an archive of past instances)

Possibly:

• add solutions or correct answers where known, in the file format that was requested by the PACE-2017 challenge.

complete readme

someone who remembers what the abbreviations in the instance-names mean please fill-in the gaps in the readme :)