Pages that link to "Item:Q3613789"
From MaRDI portal
The following pages link to Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (Q3613789):
Displayed 7 items.
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)