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 9 items.

• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
• Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
• Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
• Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
• Parameterized algorithm for 3-path vertex cover (Q2317858) (← 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)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)