Pages that link to "Item:Q3467871"
From MaRDI portal
The following pages link to Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (Q3467871):
Displaying 6 items.
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← 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)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)