Treewidthlib
From MaRDI portal
Software:21218
No author found.
Related Items (13)
Finding Good Decompositions for Dynamic Programming on Dense Graphs ⋮ Treewidth lower bounds with brambles ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Graph-based knowledge representation. Computational foundations of conceptual graphs ⋮ Treewidth computations. I: Upper bounds ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ Treewidth computations. II. Lower bounds ⋮ On the maximum cardinality search lower bound for treewidth ⋮ A SAT Approach to Branchwidth ⋮ Encoding Treewidth into SAT ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Speeding Up Dynamic Programming with Representative Sets ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
This page was built for software: Treewidthlib
