{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\n**Graph cut optimization** is a combinatorial optimization method applicable to a family of [[functions|0EPAT51DXQ]] of discrete variables, named after the concept of cut in the theory of flow networks. Thanks to the max-flow min-cut theorem, determining the minimum cut over a [[graph|00C0BR7D7H]] representing a flow network is equivalent to computing the maximum flow over the network. Given a pseudo-Boolean function $f$, if it is possible to construct a flow network with positive weights such that\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "HZ80Q3SVXK"
    ],
    "kind": "concept",
    "name": "Graph cut optimization",
    "same_as": {
      "wikidata": "Q60321144",
      "wikipedia": "Graph cut optimization"
    },
    "sources": [
      {
        "locator": "Graph cut optimization",
        "mention": "wikipedia://en/59654517",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:59654517@r1373893701"
      }
    ],
    "tag": "3AQZHY04B7"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/3AQZHY04B7/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3AQZHY04B7.md",
  "msc": null,
  "name": "Graph cut optimization",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3AQ/3AQZHY04B7.md",
  "status": null,
  "tag": "3AQZHY04B7",
  "uri": "m2://3AQZHY04B7",
  "url": "https://math2.tamnd.com/wiki/graph-cut-optimization/",
  "writing": {
    "tag": "3AQZHY04B7",
    "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
      }
    ]
  }
}