Analyzing the 3-path vertex cover problem in planar bipartite graphs
From MaRDI portal
Publication:6111949
DOI10.1007/978-3-031-20350-3_10OpenAlexW4313349103MaRDI QIDQ6111949
No author found.
Publication date: 4 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_10
Related Items (1)
Cites Work
- Exact exponential algorithms.
- Design and analysis of approximation algorithms
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- Unit disk graphs
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- Improved approximation algorithms for path vertex covers in regular graphs
- Minimum \(k\)-path vertex cover
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- The vertex cover \(P_3\) problem in cubic graphs
- Planar Formulae and Their Uses
- Reducibility among Combinatorial Problems
- Computer Aided Systems Theory – EUROCAST 2005
This page was built for publication: Analyzing the 3-path vertex cover problem in planar bipartite graphs
