Finding connected \(k\)-subgraphs with high density (Q2407097): Difference between revisions

@@ Property / author @@
-Xu-jin Chen
@@ Property / author: Xu-jin Chen / rank @@
-Normal rank
@@ Property / author @@
+Xu-jin Chen
@@ Property / author: Xu-jin Chen / rank @@
+Normal rank
@@ 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.ic.2017.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2735921087
@@ Property / OpenAlex ID: W2735921087 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743407
@@ Property / cites work: Q5743407 / rank @@
+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 @@
+Relations between average case complexity and approximation complexity
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum dispersion
@@ Property / cites work: Approximation algorithms for maximum dispersion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+On Finding Dense Subgraphs
@@ Property / cites work: On Finding Dense Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+The densest \(k\)-subgraph problem on clique graphs
+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 @@
+Efficient Optimization of Monotonic Functions on Trees
+Normal rank
@@ Property / cites work @@
+Graph expansion and the unique games conjecture
@@ Property / cites work: Graph expansion and the unique games conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Q4400856
@@ Property / cites work: Q4400856 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding dense subgraphs
@@ Property / cites work: Finding dense subgraphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2407097