Wolfram Research

Second DIMACS Brockington Graph 5

The Second DIMACS Implementation Challenge: 1992-1993

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

Random graphs from Mark Brockington and Joe Culberson's generator that attempts to "hide" cliques in a graph where the expected clique size is much smaller.

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Second DIMACS Brockington Graph 5"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Second DIMACS Brockington Graph 5", All]["Summary"]
Out[2]=

Basic Applications

Show the properties of the graph:

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

Wolfram Research, "Second DIMACS Brockington Graph 5" from the Wolfram Data Repository (2019) 

Data Resource History

Source Metadata

Data Downloads

Publisher Information