Pages that link to "Item:Q2980912"
From MaRDI portal
The following pages link to Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912):
Displaying 8 items.
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)