Pages that link to "Item:Q4914440"
From MaRDI portal
The following pages link to Exact and Approximation Algorithms for Densest k-Subgraph (Q4914440):
Displaying 16 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- (Q2753729) (← links)
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
- PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)
- Discounted average degree density metric and new algorithms for the densest subgraph problem (Q5228503) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
