New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Decompositions of arbitrary C-Sets #41

Open

jpfairbanks opened this issue Jan 10, 2025 · 0 comments

Assignees

Milestone

First Implementat...

Member

jpfairbanks commented Jan 10, 2025

This can flow through the Grothendieck construction, or some denovo generalization of the junction tree algorithm.

We should test on 2D Delta Set, Petri Net, and Undirected Hypergraph

jpfairbanks assigned samuelsonric

jpfairbanks added this to the First Implementation Paper milestone

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment