Exact rooted maximum agreement forest research: algorithms, proofs, counterexamples, and reproducible verification.
-
Updated
Oct 23, 2026 - Lean
#
parameterized-algorithms
Here are 2 public repositories matching this topic...
A structural-discovery framework for discovering theorem-revealing representations, with proved local-to-global graph structure, intrinsic defect parameters, and independent Python/C++ verification — the Shunyaya Structural Discovery Compiler (SSDC).
graph-algorithms mathematics verification discrete-mathematics graph-theory combinatorics computational-complexity bipartite-graphs local-to-global independent-set parameterized-complexity mathematical-research structural-mathematics reproducible-mathematics graph-invariants shunyaya structural-discovery representation-discovery parameterized-algorithms exponential-time-hypothesis
-
Updated
Sep 18, 2026 - Python
Add this topic to your repo
To associate your repository with the parameterized-algorithms topic, visit your repo's landing page and select "manage topics."