Wolfram Data Repository
Immediate Computable Access to Curated Contributed Data
The Second DIMACS Implementation Challenge: 1992-1993
NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, The Second DIMACS Implementation Challenge: 1992-1993
(500 vertices, 23191 edges)
Retrieve the graph:
In[1]:= |
Out[1]= |
Summary properties:
In[2]:= |
Out[2]= |
Find the maximum clique:
In[3]:= |
In[4]:= |
Out[4]= |
Show the maximum clique:
In[5]:= |
Out[11]= |
Wolfram Research, "2-Fat Ring Graph with 500 vertices" from the Wolfram Data Repository (2019)