Test Instances for the Chordal Completion Problem
Description
Test instances for the Chordal Completion Problem (Minimum Fill-In). All the instances are provided by the 2017 PACE Challenge (Dell et al., 2018). The graph format is a simple text format, where each line describes one edge, given by its two endpoints separated by a whitespace, e.g.: ml mr l1 ml l2 ml l1 l2 r1 mr r2 mr r1 r2 Vertex names can be any combination of letters, digits, and _. Lines starting with ‘#’ are comments. Note that this graph format cannot describe zero-degree vertices (which are irrelevant for Chordal Completion anyway). We also provide the best known solution of each instance of the chordal completion problem in a separate file. Reference: ----------- Dell, H., Komusiewicz, C., Talmon, N., Weller, M., 2018. The pace 2017 parameterized algorithms and computational experiments challenge: The second iteration, in: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.