Benchmarks for the Subgraph Isomorphism Problem

Benchmarks for the Subgraph Isomorphism Problem

Download benchmarks

Composition of the archive:

Graph format:

Each graph is described in a text file. If the graph has n vertices, then the file has n+1 lines: