Finding Dense Subgraphs with Size Bounds
From MaRDI portal
Publication:3601165
Recommendations
Cited in
(52)- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Top-\(k\) overlapping densest subgraphs
- Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
- The densest subgraph problem with a convex/concave size function
- Almost-spanning subgraphs with bounded degree in dense graphs
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- Homophily outlier detection in non-IID categorical data
- Computing the \(k\) densest subgraphs of a graph
- Discovering subjectively interesting multigraph patterns
- Finding densest \(k\)-connected subgraphs
- Proportionally dense subgraph of maximum size: complexity and approximation
- Finding a dense-core in jellyfish graphs
- Finding connected \(k\)-subgraphs with high density
- Exact algorithms for problems related to the densest \(k\)-set problem
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Inapproximability of maximum biclique problems, minimum k-cut and densest at-least- k-subgraph from the small set expansion hypothesis
- Finding dense subgraphs with maximum weighted triangle density
- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- A local algorithm for finding dense bipartite-like subgraphs
- A local algorithm for finding dense subgraphs
- Finding Connected Dense k-Subgraphs
- Sandwiching a densest subgraph by consecutive cores
- Dense subgraphs in biological networks
- Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset
- On Finding Dense Subgraphs
- Parameterized complexity of finding small degree-constrained subgraphs
- The densest subgraph problem with a convex/concave size function
- Finding dense subgraphs of sparse graphs
- Dense subgraphs on dynamic networks
- On set expansion problems and the small set expansion conjecture
- Dense subgraph problems with output-density conditions
- Greedily finding a dense subgraph
- Test dense subgraphs in sparse uniform hypergraph
- Sparse graphs are near-bipartite
- Fast algorithms for constrained graph density problems
- Finding a Dense-Core in Jellyfish Graphs
- On solving the densest \(k\)-subgraph problem on large graphs
- Algorithms and Computation
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- In search of dense subgraphs: How good is greedy peeling?
- Covering a graph with densest subgraphs
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
- Sum-of-squares lower bounds for densest k-subgraph
- Distributed dense subgraph detection and low outdegree orientation
- Practical parallel algorithms for near-optimal densest subgraphs on massive graphs
- Covering a graph with densest subgraphs
- Approximation algorithm for extracting densest subgraph over matching-like constraints
- On the generalized mean densest subgraph problem: complexity and algorithms
- A note on approximability of densest at-least-k-subgraph
- Isolation concepts for efficiently enumerating dense subgraphs
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
This page was built for publication: Finding Dense Subgraphs with Size Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601165)
