Pages that link to "Item:Q477591"
From MaRDI portal
The following pages link to A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591):
Displayed 31 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- 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)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← 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 algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← 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)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem (Q5038340) (← links)
- (Q5092393) (← links)
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)