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-decompositionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| edge_mask | See schema | Yes | |
| claim_size | See schema | Yes |
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
}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
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.