Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267): Difference between revisions

@@ Property / cites work @@
+Minconvex Factors of Prescribed Size in Graphs
@@ Property / cites work: Minconvex Factors of Prescribed Size in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum vertex coverage problem on bipartite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of Vertex Cover variants
@@ Property / cites work: Parameterized complexity of Vertex Cover variants / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+The \textsc{max quasi-independent set} problem
@@ Property / cites work: The \textsc{max quasi-independent set} problem / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
+Normal rank
@@ Property / cites work @@
+Densest k-Subgraph Approximation on Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-edge subgraph problems
@@ Property / cites work: \(k\)-edge subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3455036
@@ Property / cites work: Q3455036 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for Partial Vertex Cover
@@ Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
+Normal rank
@@ Property / cites work @@
+PTAS for Densest k-Subgraph in Interval Graphs
@@ Property / cites work: PTAS for Densest k-Subgraph in Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Sparsest k-Subgraph in Chordal Graphs
+Normal rank