Pages that link to "Item:Q5918282"
From MaRDI portal
The following pages link to Parameterized complexity of min-power asymmetric connectivity (Q5918282):
Displayed 4 items.
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- (Q5919472) (redirect page) (← links)
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts (Q6039417) (← links)