Pages that link to "Item:Q1040646"
From MaRDI portal
The following pages link to Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646):
Displayed 36 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Directed elimination games (Q896668) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- (Q5092402) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- (Q6065417) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)