Analyzing the 3-path vertex cover problem in selected graph classes
From MaRDI portal
Cites work
- A factor 2 approximation algorithm for the vertex cover P₃ problem
- A primal-dual approximation algorithm for the vertex cover P^3 problem
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- Analyzing the 3-path vertex cover problem in planar bipartite graphs
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- Computer Aided Systems Theory – EUROCAST 2005
- Design and analysis of approximation algorithms
- Efficient bounds for the stable set, vertex cover and set packing problems
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- Independent packings in structured graphs
- Minimum \(k\)-path vertex cover
- New results on induced matchings
- Node-Deletion Problems on Bipartite Graphs
- On \({\mathcal F}\)-independence in graphs
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Optimization, approximation, and complexity classes
- Planar Formulae and Their Uses
- Reducibility among combinatorial problems
- Some APX-completeness results for cubic graphs
- Some results on graphs without long induced paths
- The complexity of dissociation set problems in graphs
- The complexity of restricted spanning tree problems
- The vertex cover \(P_3\) problem in cubic graphs
This page was built for publication: Analyzing the 3-path vertex cover problem in selected graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976872)
