Dense subgraph problems with output-density conditions

DOI10.1145/1383369.1383374zbMath1445.68355OpenAlexW2161922819MaRDI QIDQ4962748

Akiko Suzuki, Takeshi Tokuyama

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1383369.1383374

zbMATH Keywords

combinatorial optimizationapproximation algorithmsrandomized algorithmsdense subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20) Density (toughness, etc.) (05C42)

Related Items (1)

Sum-of-squares lower bounds for densest \(k\)-subgraph

This page was built for publication: Dense subgraph problems with output-density conditions