Pages that link to "Item:Q3088075"
From MaRDI portal
The following pages link to New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075):
Displaying 8 items.
- Planar graph vertex partition for linear problem kernels (Q355502) (← 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)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- An improved algorithm for parameterized edge dominating set problem (Q2790152) (← links)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)