Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
Cited in
(16)- Computing optimal Steiner trees in polynomial space
- Exponential-time approximation of weighted set cover
- Exact algorithms for exact satisfiability and number of perfect matchings
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Algorithms for four variants of the exact satisfiability problem
- Counting perfect matchings as fast as Ryser
- Set partitioning via inclusion-exclusion
- A faster algorithm for the 4-coloring problem
- Branch and recharge: exact algorithms for generalized domination
- Parameterized complexity of perfectly matched sets
- Partitioning into sets of bounded cardinality
- Exact covers via determinants
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Solving connected dominating set faster than \(2^n\)
- More Efficient Match-Making and Satisfiability The Five Card Trick
This page was built for publication: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613789)
