Exact and Approximation Algorithms for Densest k-Subgraph
From MaRDI portal
Publication:4914440
DOI10.1007/978-3-642-36065-7_12zbMath1379.68378OpenAlexW1571644423MaRDI QIDQ4914440
Ioannis Milis, Nicolas Bourgeois, Vangelis Th. Paschos, Giorgio Lucarelli, Aristotelis Giannakos
Publication date: 12 April 2013
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36065-7_12
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (9)
A review on algorithms for maximum clique problems ⋮ Complexity and approximability of the happy set problem ⋮ Parameterized algorithms for graph partitioning problems ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ Exact algorithms for problems related to the densest \(k\)-set problem ⋮ Parameterized approximability of maximizing the spread of influence in networks ⋮ Parameterized algorithms for the happy set problem ⋮ Graph classes and approximability of the happy set problem ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
This page was built for publication: Exact and Approximation Algorithms for Densest k-Subgraph
