Pages that link to "Item:Q2659056"

The following pages link to An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056):

Displaying 3 items.

• Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
• Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)