Pages that link to "Item:Q2930282"
From MaRDI portal
The following pages link to Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282):
Displaying 10 items.
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- (Q4425961) (← links)
- (Q5115821) (← links)
