Pages that link to "Item:Q1613384"
From MaRDI portal
The following pages link to Complexity of finding dense subgraphs (Q1613384):
Displayed 29 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Graph clustering (Q458448) (← links)
- Approximation algorithms for the minimum rainbow subgraph problem (Q709311) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- Minimum budget for misinformation blocking in online social networks (Q2279752) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
- (Q2857441) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Covering a graph with densest subgraphs (Q6102273) (← links)