structured-decomp

SKILL.md

"Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves" — ACT 2023, Benjamin Merlin Bumpus et al.

"any computational problem which can be represented as a sheaf with respect to these topologies can be decided in linear time on classes of inputs which admit decompositions of bounded width" — arXiv:2302.05575

Key Insight: Structured decompositions define Grothendieck topologies on categories of data (adhesive categories). This leads to algorithms on objects of any C-set category - structures such as: symmetric graphs, directed graphs, hypergraphs, databases, simplicial complexes, port graphs.

StructuredDecompositions.jl은 양방향 탐색을 통해 FPT 알고리즘에 대한 트리 분해를 수행합니다. 출처: plurigrid/asi.

원본 보기