{
  "aliases": [
    "colour-coding",
    "the-method-of-color-coding"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn computer science and graph theory, the term **color-coding** refers to an algorithmic technique which is useful in the discovery of network motifs. For example, it can be used to detect a [[simple path|03NAMV1DHJ]] of length $k$ in a given graph. The traditional color-coding algorithm is probabilistic, but it can be derandomized without much overhead in the running time.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "colour-coding",
      "the-method-of-color-coding"
    ],
    "inventory": [
      "EGGRQNZDDH"
    ],
    "kind": "concept",
    "name": "Color-coding",
    "same_as": {
      "wikidata": "Q5148529",
      "wikipedia": "Color-coding"
    },
    "sources": [
      {
        "locator": "Color-coding",
        "mention": "wikipedia://en/22469695",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:22469695@r1369278554"
      }
    ],
    "tag": "HV2XNZZ9ZG"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/HV2XNZZ9ZG/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/HV2XNZZ9ZG.md",
  "msc": null,
  "name": "Color-coding",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/HV2/HV2XNZZ9ZG.md",
  "status": null,
  "tag": "HV2XNZZ9ZG",
  "uri": "m2://HV2XNZZ9ZG",
  "url": "https://math2.tamnd.com/wiki/color-coding/",
  "writing": {
    "tag": "HV2XNZZ9ZG",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}