Pages that link to "Item:Q906446"

The following pages link to An FPT algorithm for the vertex cover \(P_4\) problem (Q906446):

Displaying 11 items.

• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
• Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
• An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056) (← links)
• Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
• (Q5092393) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
• Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)