Partitioning a graph into small pieces with applications to path transversal (Q2316611): Difference between revisions

@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+The \(k\)-separator problem: polyhedra, complexity and approximation results
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Q4636433
@@ Property / cites work: Q4636433 / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / 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 @@
+Approximation Algorithms for the 0-Extension Problem
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter and Approximation Algorithms: A New Look
+Normal rank
@@ Property / cites work @@
+A new multilayered PCP and the hardness of hypergraph vertex cover
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Fast Approximate Graph Partitioning Algorithms
@@ Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer approximation algorithms via spreading metrics
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
+Normal rank
@@ Property / cites work @@
+Inapproximability of H-Transversal/Packing
@@ Property / cites work: Inapproximability of H-Transversal/Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for 3-path vertex cover
@@ Property / cites work: A faster FPT algorithm for 3-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Q4633907
@@ Property / cites work: Q4633907 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4180391
@@ Property / cites work: Q4180391 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank