# 1 WebCompute

Note: Their website also features proofs of the crossing numbers of many of the Rome-Lib graphs. Newest version of database specifies non-planar graphs, but older versions do have some planar graphs. Origin Notes: The dataset is comprised of instances of graphs uploaded to Crossing Number WebCompute, attributed to M. Chimani, T. Wiedera. http://crossings.uos.de/cr-proof-system-paper. graph features handled: Known crossing number, Nonplanar Graph features in papers: generic Origin Paper: An ILP-based Proof System for the Crossing Number Problem (https://www.notion.so/An-ILP-based-Proof-System-for-the-Crossing-Number-Problem-c71817d4f3a44de4943b8ad3980da063?pvs=21) Originally found at: https://tcs.uos.de/doku.php?id=research/cr Size: 3-112 nodes, 3-366 edges Number of Graphs: 507 Appeared in years: 2016 Type of Collection: Uniform Benchmark is it stored properly?: No must be analyzed: No In repo?: Yes Related to Literature - Algorithm (1) (Dataset tag relations): An ILP-based Proof System for the Crossing Number Problem (https://www.notion.so/An-ILP-based-Proof-System-for-the-Crossing-Number-Problem-b61271c4f96a4633aba0179af767a5e0?pvs=21) cleaned format?: Yes duplicate?: No link works?: No Added in paper: No OSF link json: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d90ea01101aa0c9e6a0c74 Origin paper plaintext: An ILP-based Proof System for the Crossing Number Problem Page id: 7a10c41801914e6faa5a6cc1b1ef0b77 unavailable/skip: No Cleaned ALL data: No OSF link gexf: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d94828803e0c0bf5558bab OSF link gml: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d94d7d803e0c0c1f558c9c OSF link graphml: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d9709994a6be112912e9ec first look: No sparkline data: {‘min’: 3, ‘max’: 112, ‘step_size’: 5, ‘num_bins’: 23, ‘bins’: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110], ‘num_nodes’: [5, 168, 70, 114, 65, 17, 23, 11, 7, 2, 3, 4, 3, 1, 2, 1, 1, 0, 0, 2, 7, 0, 1]} Related to Literature - Algorithm (Dataset tag relations) 1: An ILP-based Proof System for the Crossing Number Problem (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/An%20ILP-based%20Proof%20System%20for%20the%20Crossing%20Number%20%20e172212e85b74e12bcf2d0320d2b1eb6.md)

# 2 Body

### Statistics

four_in_one.svg

### Descriptions from Literature

From “An ILP-based Proof System for the Crossing Number Problem”:

> To determine the applicability of the proof system, we tested the algorithms on three benchmark sets: the 3110 non-trivial Rome graphs [14], the 1277 North graphs [15], and the145 non-planar graphs (http://crossings.uos.de/instances) collected by our crossing number web-service.

=== STOP RENDERING ===

Paper attached to his dataset provides no visuliaztion of the graph, https://arxiv.org/abs/2108.11443 also uses the dataset and provides no visualizations of the graphs themselves