Here, you can find the benchmark sets used in our computational study of upward planarity. Detailed descriptions can be found in the paper:

• M. Chimani, R. Zeranski. Upward Planarity Testing: A Computational Study. 21th International Symposium on Graph Drawing (GD'13), Bordeaux, 2013. LNCS 8242.

In the following, we describe the file formats via small examples, which should suffice for understanding the notation of the downloadable files above.

All examples specify a connected graph on three vertices with two directed edges; the first vertex is source for both.

Our prototypical file looks like this:

LEDA.GRAPH
void
void
3
|{}|
|{}|
|{}|
2
1 2 0 |{}|
1 3 0 |{}|

The first three lines can be ignored. the forth line (3) gives the number n of vertices. The next n lines then give data for these vertices (labels, positions, etc.). In our files these lines contain only the empty data field encoded by |{}|. The next lines gives the number of edges (2), followed by that many lines specifying the individual edges. Each edge is given by its start (1) and end vertex( e.g., 2), always followed by 0 |{}|.

Our prototypical file looks like this:

Creator "ogdf::GraphIO::writeGML"
graph [
  directed 1
  node [
    id 0
  ]
  node [
    id 1
  ]
  node [
    id 2
  ]
  edge [
    source 0
    target 1
  ]
  edge [
    source 0
    target 2
  ]
]

Obvisouly, the first line can be ignored.

Our prototypical file looks like this:

<UNDISECTION>
  <NODELIST>
    <NODE>
      0
      <EDGE> 1 ->
      <EDGE> 2 ->
    </NODE>
    <NODE>
      1
      <EDGE> 0 <-
    </NODE>
    <NODE>
      2
      <EDGE> 0 <-
    </NODE>
  </NODELIST>
</UNDISECTION>  
<DRAWSECTION>
  ...
</DRAWSECTION> 

The format is XML-like, and rather selfexplanatory from above. Node the symbols following the edge descriptions that specify the edge direction! Everthing within the DRAWSECTION can be ignored.