Endpoint · researchPOSTdatenvertrag.halowerk.com /v1/cartesian-graph-factorization-family
For a fully captured simple undirected graph on original labels0..n-1,n1..6, edge_mask bits are lexicographic unordered pairs(0,1),(0,2),...,(n-2,n-1).
Read more
For a fully captured simple undirected graph on original labels0..n-1,n1..6, edge_mask bits are lexicographic unordered pairs(0,1),(0,2),...,(n-2,n-1). Synthesize ALL decompositions G=A square B into TWO connected simple factors with2<=a<=b and a*b=n. Product adjacency holds exactly when one coordinate agrees and the other factor has an edge. Return decompositions records{a,b,mask_a,mask_b,grid},count,decomposable. Factor masks use their own lexicographic unordered pairs.Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-family
Seen
first 11 days ago · last 4 days ago
20 free handshakes
Payment
Pays through
x402
Offered on?
Base USDC
Listed on?
Base
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx teppi-check https://datenvertrag.halowerk.com/v1/cartesian-graph-factorization-familycurl -s https://api.teppi.xyz/v1/trust/cap_01M6T8PJWGGGNTSAY4NW42QCHD