A new algorithm to compute the centroid decomposition of a tree in linear time.
-
Updated
Dec 9, 2020 - C++
A new algorithm to compute the centroid decomposition of a tree in linear time.
A high-performance, pure Rust library for full-atom protein side-chain packing using the DREIDING force field, Goldstein+Split DEE, and tree-decomposition DP—with native protein–ligand and protein–nucleic acid interface support.
Greatest Of All Tree Decompositions: tree decompositions of graphs — elimination orders, FlowCutter, multilevel bisection — with PACE .gr/.td I/O and a command-line solver.
To associate your repository with the tree-decomposition topic, visit your repo's landing page and select "manage topics."