Pages that link to "Item:Q3088075"

The following pages link to New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075):

Displaying 2 items.

• Planar graph vertex partition for linear problem kernels (Q355502) (← links)
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)