{
  "id": 2187,
  "title": "A more interesting problem...",
  "url": "/competitions/FacebookRecruiting/discussion/2187",
  "author_name": "",
  "post_date": "2012-07-17T19:45:02.973Z",
  "votes": null,
  "comment_count": 1,
  "views": 3561,
  "content": "<p>The facebook graph has 45558 unconnected components.</p>\r\n<p>The largest component, call it S0, has&nbsp;9,249,905 edges among 1,739,520 vertices, of which&nbsp; 382,843 are articulation points. Of these there are 75,682 where the removal of a single edge will disconnect the graph.</p>\r\n<p>Therefore: randomly removing an edge from S0 will create an unconnected component with probability approx. 0.008 (I hope)</p>\r\n<p>Take S0 and remove some number of its edges, producing a new graph S1 with a number of new unconnected components</p>\r\n<p>Challenge: find the articulation points of the original graph S0 in the new graph S1.</p>\r\n<p>Unforunately I can't offer a reward, but if we pool our resources and there's enough interest perhaps it can be arranged for a case of Miller Tall Boys to be sent to the person we all agree has the best algorithm?</p>",
  "messages": [
    {
      "id": "12410",
      "postDate": "07/17/2012 19:45:02",
      "content": "<p>The facebook graph has 45558 unconnected components.</p>\r\n<p>The largest component, call it S0, has&nbsp;9,249,905 edges among 1,739,520 vertices, of which&nbsp; 382,843 are articulation points. Of these there are 75,682 where the removal of a single edge will disconnect the graph.</p>\r\n<p>Therefore: randomly removing an edge from S0 will create an unconnected component with probability approx. 0.008 (I hope)</p>\r\n<p>Take S0 and remove some number of its edges, producing a new graph S1 with a number of new unconnected components</p>\r\n<p>Challenge: find the articulation points of the original graph S0 in the new graph S1.</p>\r\n<p>Unforunately I can't offer a reward, but if we pool our resources and there's enough interest perhaps it can be arranged for a case of Miller Tall Boys to be sent to the person we all agree has the best algorithm?</p>",
      "rawMarkdown": "",
      "votes": null
    },
    {
      "id": "12411",
      "postDate": "07/17/2012 20:07:18",
      "content": "<p>okay the probabilities are all off but the question still stands: find the articulation points after removing some edges.</p>",
      "rawMarkdown": "",
      "votes": null
    }
  ],
  "comments": [
    {
      "id": 12411,
      "author_name": "omarwugui",
      "author_url": "",
      "post_date": "07/17/2012 20:07:18",
      "content": "<p>okay the probabilities are all off but the question still stands: find the articulation points after removing some edges.</p>",
      "votes": null,
      "replies": []
    }
  ],
  "raw_markdown_by_id": {
    "12410": "",
    "12411": ""
  },
  "source": "meta"
}