Greedily Finding a Dense Subgraph
From MaRDI portal
Publication:4943076
Recommendations
Cited in
(57)- Improving graph partitions using submodular functions.
- Complexity of finding dense subgraphs
- Top-\(k\) overlapping densest subgraphs
- The densest subgraph problem with a convex/concave size function
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- The maximum exposure problem
- Finding lasting dense subgraphs
- Finding connected \(k\)-subgraphs with high density
- The densest \(k\)-subgraph problem on clique graphs
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- The complexity of detecting fixed-density clusters
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- The hospitals/residents problem with lower quotas
- PTAS for densest \(k\)-subgraph in interval graphs
- Chromatic kernel and its applications
- Finding dense subgraphs with maximum weighted triangle density
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- Combinatorial properties and further facets of maximum edge subgraph polytopes
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- Finding Connected Dense k-Subgraphs
- Sandwiching a densest subgraph by consecutive cores
- Dense subgraphs in biological networks
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Multi-way set enumeration in weight tensors
- The \textsc{max quasi-independent set} problem
- scientific article; zbMATH DE number 1182772 (Why is no real title available?)
- A graph-based active learning method for classification of remote sensing images
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Greedily finding a dense subgraph
- Mining relevant information on the Web: a clique-based approach
- Finding a Dense-Core in Jellyfish Graphs
- The Maximum Exposure Problem.
- A polyhedral study of the maximum edge subgraph problem
- A polyhedral study of the maximum edge subgraph problem
- Approximating max k-uncut via LP-rounding plus greed, with applications to densest k-subgraph
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- In search of dense subgraphs: How good is greedy peeling?
- Extracting densest sub-hypergraph with convex edge-weight functions
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- The sparse sequences of graphs
- On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
- Approximation algorithm for extracting densest subgraph over matching-like constraints
- Optirefine: densest subgraphs and maximum cuts with k refinements
- On the generalized mean densest subgraph problem: complexity and algorithms
- Solving the multiobjective quasi-clique problem
- How to allocate review tasks for robust ranking
- Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems
- Improved approximation algorithms for maximum graph partitioning problems
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- The inverse protein folding problem on 2D and 3D lattices
- Partially ordered knapsack and applications to scheduling
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
This page was built for publication: Greedily Finding a Dense Subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943076)
