Kernelization of the 3-path vertex cover problem (Q279214): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2015.12.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2275951435
@@ Property / OpenAlex ID: W2275951435 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Looking at the stars
@@ Property / cites work: Looking at the stars / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex cover \(P_3\) problem in cubic graphs
@@ Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:279214