Pages that link to "Item:Q903365"
From MaRDI portal
The following pages link to A faster FPT algorithm for 3-path vertex cover (Q903365):
Displaying 26 items.
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← 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)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- (Q5092393) (← links)
- (Q5225203) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- Maximum dissociation sets in subcubic trees (Q6176408) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)