"bipartization" meaning in English

{
  "forms": [
    {
      "form": "bipartizations",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bipartization (plural bipartizations)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Piotr Gnaciński, Monika Rosicka, Ravishankar Ramanathan, Karol Horodecki, Michał Horodecki, Paweł Horodecki, Simone Severini, “Linear game non-contextuality and Bell inequalities - a graph-theoretic approach”, in arXiv",
          "text": "We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The removal of vertices from a graph in order to make it bipartite"
      ],
      "id": "en-bipartization-en-noun-jEzxq5P4",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "removal",
          "removal"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "bipartite",
          "bipartite"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The removal of vertices from a graph in order to make it bipartite"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bipartization"
}

{
  "forms": [
    {
      "form": "bipartizations",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bipartization (plural bipartizations)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Piotr Gnaciński, Monika Rosicka, Ravishankar Ramanathan, Karol Horodecki, Michał Horodecki, Paweł Horodecki, Simone Severini, “Linear game non-contextuality and Bell inequalities - a graph-theoretic approach”, in arXiv",
          "text": "We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The removal of vertices from a graph in order to make it bipartite"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "removal",
          "removal"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "bipartite",
          "bipartite"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The removal of vertices from a graph in order to make it bipartite"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bipartization"
}