Pages that link to "Item:Q392035"
From MaRDI portal
The following pages link to New parameterized algorithms for the edge dominating set problem (Q392035):
Displaying 19 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- An improved algorithm for parameterized edge dominating set problem (Q2790152) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)
- New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- (Q5090486) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)
