The following pages link to Minimum \(k\)-path vertex cover (Q2275922):
Displaying 50 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Augmenting approach for some maximum set problems (Q284765) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← 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 PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← 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)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← 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)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Colored cut games (Q2087453) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← 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)
- Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand (Q2140220) (← links)
- Geodesic transversal problem for join and lexicographic product of graphs (Q2140756) (← 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)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
