{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Problem\n\nIn the theory of parallel algorithms, the **1-vs-2 cycles problem** concerns a simplified case of graph connectivity. The input to the problem is a [[2-regular graph|0KA4S8R39M]], forming either a single connected $n$-vertex cycle or two disconnected $n/2$-vertex cycles. The problem is to determine whether the input has one or two cycles.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "5B8TH73619"
    ],
    "kind": "problem",
    "name": "1-vs-2 cycles problem",
    "same_as": {
      "wikidata": "Q131412142",
      "wikipedia": "1-vs-2 cycles problem"
    },
    "sources": [
      {
        "locator": "1-vs-2 cycles problem",
        "mention": "wikipedia://en/78440969",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:78440969@r1365430189"
      }
    ],
    "tag": "5VZV0XJSAJ"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/5VZV0XJSAJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/5VZV0XJSAJ.md",
  "msc": null,
  "name": "1-vs-2 cycles problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5VZ/5VZV0XJSAJ.md",
  "status": null,
  "tag": "5VZV0XJSAJ",
  "uri": "m2://5VZV0XJSAJ",
  "url": "https://math2.tamnd.com/wiki/1-vs-2-cycles-problem/",
  "writing": {
    "tag": "5VZV0XJSAJ",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      },
      {
        "what": "section History",
        "note": "with the year of the first source",
        "have": 0,
        "want": 1
      }
    ]
  }
}