Wolfram Data Repository

Immediate Computable Access to Curated Contributed Data

2-Fat Ring Graph with 500 vertices

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)

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["2-Fat Ring Graph with 500 vertices"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["2-Fat Ring Graph with 500 vertices", All]["Summary"]
Out[2]=

Basic Applications

Find the maximum clique:

In[3]:=
g = ResourceData["2-Fat Ring Graph with 500 vertices"];
In[4]:=
maxclique = FindClique[g]
Out[4]=

Show the maximum clique:

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

Wolfram Research, "2-Fat Ring Graph with 500 vertices" from the Wolfram Data Repository (2019)  

Data Resource History

  • Date Created:

Source Metadata

  • Citation:
    • P. Berman and A. Pelc, Distributed Fault Diagnosis for Multiprocessor Systems, Proceedings of the 20th Annual International Symposium on Fault-Tolerant Computing Newcastle, UK, 340-346 (1990)

Data Downloads

Publisher Information

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