Pages that link to "Item:Q2249747"
From MaRDI portal
The following pages link to Inclusion/exclusion meets measure and conquer (Q2249747):
Displayed 5 items.
- Roman domination in subgraphs of grids (Q324726) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Exact Algorithms for the Minimum Load Spanning Tree Problem (Q5084607) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
