Second DIMACS Sanchis Graph 12

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Laura Sanchis

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

(200 vertices, 13868 edges)

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Second DIMACS Sanchis Graph 12"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Second DIMACS Sanchis Graph 12", All]["Summary"]
Out[2]=

Basic Applications

Show the properties of the graph:

In[3]:=
g = ResourceData["Second DIMACS Sanchis Graph 12"];
In[4]:=
Dataset[<|# -> #[g]|> & /@ {GraphDiameter, GraphDensity, MeanGraphDistance, GraphLinkEfficiency}]
Out[4]=

Wolfram Research, "Second DIMACS Sanchis Graph 12" from the Wolfram Data Repository (2019)  

Data Resource History

Source Metadata

Data Downloads

Publisher Information