This is the set of graphs used in the PACE 2022 challenge for computing the Directed Feedback Vertex Set, from the Exact track. It consists of 200 labelled directed graphs. The graphs range in size up to from N=512 up to N=131072 vertices, and up to 1315170 edges. The graphs are mostly not symmetric (an edge form u->v does not imply an edge from v->u), although some are symmetric. The graph labels are integers ranging from 1 to N. Those graphs are generally larger and denser, as approximate solutions were still accepted. An example graph would be ``` 4 4 0 2 3 3 1 ``` The dataset can be downloaded here.
2 PAPERS • NO BENCHMARKS YET
This is the set of graphs used in the PACE 2022 challenge for computing the Directed Feedback Vertex Set, from the Heuristic track. It consists of 200 labelled directed graphs. The graphs are mostly not symmetric (an edge form u->v does not imply an edge from v->u), although some are symmetric. The graph labels are integers ranging from 1 to N. There is the related PACE 2022 Exact dataset, which was for exact computation; those graphs are generally smaller and sparser, as only exact solutions were accepted. An example graph would be ``` 4 4 0 2 3 3 1 ``` The dataset can be downloaded here.
1 PAPER • NO BENCHMARKS YET
…Each instance is an undirected graph, one edge per line, in the format a b indicating an edge between vertices a and b. Vertices are 1-indexed.