Pages that link to "Item:Q2317858"
From MaRDI portal
The following pages link to Parameterized algorithm for 3-path vertex cover (Q2317858):
Displaying 26 items.
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← 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)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- (Q5092393) (← links)
- Parameterized and Exact Computation (Q5311523) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs (Q6591469) (← links)
