Pages that link to "Item:Q2958319"
From MaRDI portal
The following pages link to Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319):
Displaying 7 items.
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)