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 7 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)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
