Pages that link to "Item:Q5207854"

The following pages link to An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth (Q5207854):

Displaying 12 items.

• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
• General d-position sets (Q5013341) (← links)
• (Q5225203) (← links)
• The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
• Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
• The maximum number of maximum generalized 4-independent sets in trees (Q6606325) (← links)
• Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)