Second DIMACS Brockington Graph 4

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Mark Brockington

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.

(200 vertices, 13089 edges)

Examples

Basic Examples

Retrieve the graph:

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

Summary properties:

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

Basic Applications

Find the maximum clique:

In[3]:=
g = ResourceData["Second DIMACS Brockington Graph 4"];
In[4]:=
maxclique = FindClique[g]
Out[4]=
In[5]:=
maxcliqout = {{12, 19, 28, 29, 38, 54, 65, 71, 79, 93, 117, 127, 139, 161, 165, 186, 192}};

Show the maximum clique:

In[6]:=
HighlightGraph[g, Subgraph[g, maxclique], VertexCoordinates -> ReplacePart[
GraphEmbedding[g, "SpringElectricalEmbedding"], 
Thread[Map[VertexIndex[g, #]& , 
First[maxclique]] -> CirclePoints[{2.9, 1}, 0.7, 
Length[
First[maxclique]]]]], Sequence[
 EdgeStyle -> {Blank[] -> Opacity[0.05]}, GraphLayout -> "SpringElectricalEmbedding", VertexSize -> {Blank[] -> 0.5}]]
Out[7]=

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

Data Resource History

Source Metadata

Data Downloads

Publisher Information