The following pages link to Minimum \(k\)-path vertex cover (Q2275922):
Displaying 34 items.
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption (Q2807191) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- (Q5091062) (← links)
- (Q5092393) (← links)
- The k-Observer Problem on d-regular Graphs (Q5207902) (← links)
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Minimal path cover sets and monomial ideals (Q5498570) (← links)
- 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← 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)
- Maximum dissociation sets in subcubic trees (Q6176408) (← links)
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
- On the Harary Index of Graphs with Given Dissociation Number (Q6182443) (← links)
- Extremal vertex-degree function index with given order and dissociation number (Q6184319) (← links)
- Minimum number of maximal dissociation sets in trees (Q6193972) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← 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)
- Approximation algorithm for prize-collecting vertex cover with fairness constraints (Q6646739) (← links)
- On the minimum spectral radius of graphs with given order and dissociation number (Q6657251) (← links)
