Below, enter an input graph with at most 100 nodes and 200 edges, as well as your name, affiliation and e-mail address. We will preprocess the graph by separating the biconnected components and perform non-planar core reductions. The crossing number of each reduced component will be computed.

You will receive a visualization of the non-planar biconnected components, the non-planar core reduction of each component, an optimal planarization of each component, and a proof file for each component containing all required information to comprehend that there cannot be a better solution.

We support a variety of graph formats but recommend to use GML.

Your Name

Your Affiliation

Your Email Address

Short Title

The Graph

Purpose

Please note that the above data will be stored exclusively for scientific purposes.