Wolfram Data Repository

Immediate Computable Access to Curated Contributed Data

Steiner Triple System A45 Graph

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Carlo Mannino

NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, The Second DIMACS Implementation Challenge: 1992-1993.

Clique formulation of the Steiner Triple Problem, translated from the set covering formulation.

(1035 vertices, 533115 edges)

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Steiner Triple System A45 Graph"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Steiner Triple System A45 Graph", All]["Summary"]
Out[2]=

Basic Applications

Show the properties of the graph:

In[3]:=
g = ResourceData["Steiner Triple System A45 Graph"];
In[4]:=
Dataset[<|# -> #[g]|> & /@ {GraphDiameter, GraphDensity, MeanGraphDistance, GraphLinkEfficiency}]
Out[4]=

Wolfram Research, "Steiner Triple System A45 Graph" from the Wolfram Data Repository (2019)  

Data Resource History

  • Date Created:

Source Metadata

  • Citation:
    • Carlo Mannino and Antonio Sassano, An exact algorithm for the maximum stable set problem, A. Comput Optim Applic (1994) 3: 243. https://doi.org/10.1007/BF01299447

Data Downloads

Publisher Information

  • Prepared for the Wolfram Data Repository By: Wolfram
  • Publisher of Record: Wolfram Research