Wolfram Data Repository

Immediate Computable Access to Curated Contributed Data

Second DIMACS P-Hat Graph 5

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.

(1500 vertices, 568960 edges)

Examples

Basic Examples

Retrieve the graph:

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

Summary properties:

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

Basic Applications

Show the properties of the graph:

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

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

Data Resource History

  • Date Created:

Source Metadata

  • Citation:
    • Michel Gendreau, Patrick Soriano and Louis Salvail, Solving the Maximum Clique Problem Using a Tabu Search Approach, Annals of Operations Research 41, 385-403 (1993).

Data Downloads

Publisher Information

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