Skip to content
HALOWERK

Datenvertragswerk

graph gallai edmonds decomposition

For a labelled simple undirected graph n1..6, edge_mask bits name lexicographic pairs(i,j),i<j. D is the vertex set exposable by some maximum matching, A comprises all neighbors ofD outsideD, and C is the remaining set. Sets are vertexbitmasks. Return maximum matching size, sorted inducedDcomponent masks and deficiency=count(Dcomponents)-popcount(A)=n-2matching_size. Every Dcomponent is factor-critical: for every removed vertex return a lexicographically least perfect matching of its.

POST https://datenvertrag.halowerk.com/v1/graph-gallai-edmonds-decomposition

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nSee schemaYes
edge_maskSee schemaYes
claim_sizeSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "n": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 1,
          "maximum": 6
        },
        {
          "type": "null"
        }
      ]
    },
    "edge_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 32767
        },
        {
          "type": "null"
        }
      ]
    },
    "claim_size": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 3
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "edge_mask",
    "claim_size"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 3,
  "edge_mask": 7,
  "claim_size": 1
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’