Pages that link to "Item:Q863574"
From MaRDI portal
The following pages link to Experiments on data reduction for optimal domination in networks (Q863574):
Displaying 21 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Uncertain weighted dominating set: a prototype application on natural disaster relief management (Q1797772) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Independent strong domination in complementary prisms (Q4957962) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
