Pages that link to "Item:Q2790152"
From MaRDI portal
The following pages link to An improved algorithm for parameterized edge dominating set problem (Q2790152):
Displaying 11 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← 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)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Improved complexity for power edge set problem (Q1642691) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- (Q5090486) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)