HALOWERKDatenvertragswerk
minimum edge clique partition family
For a fully captured simple undirected graph on 0..4 labelled vertices, construct EVERY minimum-cardinality partition of its EDGE set into cliques, each edge used exactly once. Cliques contain at least two vertices; isolated vertices require no clique. Return all eligible clique vertex masks in numeric order, their ascending whole vertex lists, their whole uppertriangle edge masks, all optimal partitions as ascending clique-index lists in numeric lexicographic order, and minimum_size. Edge.
POST https://datenvertrag.halowerk.com/v1/minimum-edge-clique-partition-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| edges | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges",
"claim"
],
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"edges": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"clique_masks",
"clique_vertices",
"edge_masks",
"optimal_partitions",
"minimum_size"
],
"properties": {
"clique_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 11
},
"clique_vertices": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 4
},
"minItems": 0,
"maxItems": 11
},
"edge_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 0,
"maxItems": 11
},
"optimal_partitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 10
},
"minItems": 0,
"maxItems": 6
},
"minItems": 0,
"maxItems": 203
},
"minimum_size": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 0,
"edges": [],
"claim": {
"clique_masks": [],
"clique_vertices": [],
"edge_masks": [],
"optimal_partitions": [
[]
],
"minimum_size": 0
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden