Pages that link to "Item:Q2891336"

The following pages link to A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336):

Displayed 9 items.

• Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) ‎ (← links)
• Exact algorithms for Kayles (Q476858) ‎ (← links)
• Exact algorithms for minimum weighted dominating induced matching (Q521800) ‎ (← links)
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) ‎ (← links)
• The many facets of upper domination (Q1704853) ‎ (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) ‎ (← links)
• Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) ‎ (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) ‎ (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) ‎ (← links)