Pages that link to "Item:Q3066473"
From MaRDI portal
The following pages link to Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473):
Displaying 8 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- An improved algorithm for parameterized edge dominating set problem (Q2790152) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- (Q5090486) (← links)