GD04 Contest Problem 9
Graph Drawing 2004 crossing minimisation contest, Problem 9. 112 nodes, 168 edges.
npx keepset fetch pajek-gd04-prob9
- Nodes
- 112
- Edges
- 168
- Size
- 236.5 KiB
Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.
Overview
Sources and provenance
Citations
- S. Kobourov (2004). GD 2004 Graph Drawing Contest.
Recipe
| Source | #0 |
|---|
| Archive | zip |
|---|
| Member | ending .zip |
|---|
| Inner archive | zip |
|---|
| Inner member | challenge/prob9.gd4 |
|---|
| Parser format | "gd-contest" |
|---|
| Parser encoding | "utf-8" |
|---|
Crosswalk
keepset/topology to graph/v1, as a crossmap crosswalk.
| Rule | From | To | Direction |
|---|
| move | meta | meta | both |
| move | nodes[].id | nodes[].id | both |
| move | edges[].source | edges[].source | both |
| move | edges[].target | edges[].target | both |
Expected counts
Properties
| Components | 1 |
|---|
| Connected | yes |
|---|
| Cyclic | yes |
|---|
| Density | 0.02703 |
|---|
| Directed | no |
|---|
| Download bytes | 236.5 KiB |
|---|
| Edge types | 1 |
|---|
| Heterogeneous | no |
|---|
| Multigraph | no |
|---|
| Node types | 1 |
|---|
| Raw bytes | 13.4 KiB |
|---|
| Self loops | no |
|---|
| Weighted | no |
|---|