Wolfram Research

Second DIMACS P-Hat Graph 6

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Patrick Soriano and Michel Gendreau

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

Random graphs generated with the p hat generator which is a generalization of the classical uniform random graph generator. Uses 3 parameters: n, the number of nodes, and a and b, two density parameters verifying 0 <= a <= b <= 1.

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Second DIMACS P-Hat Graph 6"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Second DIMACS P-Hat Graph 6", All]["Summary"]
Out[2]=

Basic Applications

Show the properties of the graph:

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

Wolfram Research, "Second DIMACS P-Hat Graph 6" from the Wolfram Data Repository (2019) 

Data Resource History

Source Metadata

Data Downloads

Publisher Information