Compute Generalized Hypertree Decompositions via balanced separators, in Go with a focus on parallelism
-
Updated
Jul 11, 2023 - Go
Compute Generalized Hypertree Decompositions via balanced separators, in Go with a focus on parallelism
A native HoTT (Homotopy Type Theory) kernel in Go, evolving from a hypergraph theory library.
A hyper-graph based payment channel network.
log-k-decomp implements a novel parallel algorithm to compute Hypertree Decompositions based on the structural information of CQs or CSPs. This can then be used to evaluate them in provably polynomial time.
Add a description, image, and links to the hypergraph topic page so that developers can more easily learn about it.
To associate your repository with the hypergraph topic, visit your repo's landing page and select "manage topics."