# SteinLib

Note: SteinLib is a collection of Steiner tree problems in graphs and variants. Their https://steinlib.zib.de/steinlib.php has additional information about each problem in the dataset, including whether or not it has been solved. We omit two sets, https://steinlib.zib.de/showset.php?Relay and https://steinlib.zib.de/showset.php?EFST, from our provided data due to size constraints.
Origin Notes: Introduced in “https://link.springer.com/chapter/10.1007/978-1-4613-0255-1_9”
graph features handled: Generic, Mesh, Sparse, Weighted edges
Graph features in papers: planar
Origin Paper: SteinLib: An Updated Library on Steiner Tree Problems in Graphs (https://www.notion.so/SteinLib-An-Updated-Library-on-Steiner-Tree-Problems-in-Graphs-36c34a7a5596442ca7691590d7108732?pvs=21)
Originally found at: https://steinlib.zib.de/steinlib.php
Size: 6-38,418 nodes, 9-221,445 edges
Number of Graphs: 1207
Appeared in years: 2016
Type of Collection: Uniform Benchmark
is it stored properly?: No
must be analyzed: No
In repo?: No
Related to Literature - Algorithm (1) (Dataset tag relations): A Note on the Practicality of Maximal Planar Subgraph Algorithms (https://www.notion.so/A-Note-on-the-Practicality-of-Maximal-Planar-Subgraph-Algorithms-cbca5aa1135a4ba29ea6e508f1c4d02b?pvs=21)
cleaned format?: No
duplicate?: No
link works?: No
Added in paper: No
OSF link json: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d90e5e1101aa0c9f6a0c0f
Origin paper plaintext: SteinLib: An Updated Library on Steiner Tree Problems in Graphs
Page id: 4b766ffe22de40ecaa9307671862ea96
unavailable/skip: Yes
Cleaned ALL data: No
OSF link gexf: https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d948684cf74810580556ac
OSF link gml: https://osf.io/download/zbrf5/
OSF link graphml:  https://files.osf.io/v1/resources/j7ucv/providers/osfstorage/64d970300c2b4d0f61386324
first look: No
sparkline data: {'min': 6, 'max': 38418, 'step_size': 1500, 'num_bins': 26, 'bins': [0, 1500, 3000, 4500, 6000, 7500, 9000, 10500, 12000, 13500, 15000, 16500, 18000, 19500, 21000, 22500, 24000, 25500, 27000, 28500, 30000, 31500, 33000, 34500, 36000, 37500], 'num_nodes': [1012, 121, 30, 8, 8, 6, 2, 4, 0, 1, 0, 1, 5, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 4]}
Related to Literature - Algorithm (Dataset tag relations) 1: A Note on the Practicality of Maximal Planar Subgraph Algorithms (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/A%20Note%20on%20the%20Practicality%20of%20Maximal%20Planar%20Subgr%203b027747aec54f60a35f138958faff21.md)

# Body

### Statistics

![four_in_one.svg](SteinLib%204b766ffe22de40ecaa9307671862ea96/four_in_one.svg)

### Descriptions from Literature

From [A Note on the Practicality of Maximal Planar Subgraph Algorithms](https://doi.org/10.1007/978-3-319-50106-2_28):

> We use the non-planar graphs of the established benchmark sets North [12] (423 instances), Rome [11] (8249), and **SteinLib** [16] (586), all of which include real-world instances. In our plots, we group instances according to |V| rounded to the nearest multiple of 10; for Rome we only consider graph with ≥ 25 vertices.
> 

### Example Figures

From [SteinLib: An Updated Library on Steiner Tree Problems in Graphs](https://doi.org/10.1007/978-1-4613-0255-1_9):

![Screen Shot 2023-08-09 at 4.09.50 PM.png](SteinLib%204b766ffe22de40ecaa9307671862ea96/Screen_Shot_2023-08-09_at_4.09.50_PM.png)

=== STOP RENDERING ===

Is it lost?