The following pages link to On Finding Dense Subgraphs (Q3638066):
Displaying 50 items.
- Chromatic kernel and its applications (Q266072) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Homophily outlier detection in non-IID categorical data (Q2036755) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Discovering subjectively interesting multigraph patterns (Q2203340) (← links)
- Finding lasting dense subgraphs (Q2218373) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure (Q2872130) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks (Q2958312) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (Q3467871) (← links)
- Dense subgraph problems with output-density conditions (Q4962748) (← links)
- Dense Induced Subgraphs of Dense Bipartite Graphs (Q4986805) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Brief announcement (Q5891981) (← links)
- (Q6065417) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Distributed dense subgraph detection and low outdegree orientation (Q6535012) (← links)
- A multivariate to multivariate approach for voxel-wise genome-wide association analysis (Q6618397) (← links)
- On approximating partial scenario set cover (Q6652422) (← links)
- Covering a graph with densest subgraphs (Q6659505) (← links)
