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