Pages that link to "Item:Q2410093"

The following pages link to On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093):

Displaying 15 items.

• Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
• On the parameterized complexity of spanning trees with small vertex covers (Q779245) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
• Algorithm for online 3-path vertex cover (Q2300630) (← links)
• Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
• Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
• Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• (Q5225203) (← links)
• Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)