Finding dense subgraphs
From MaRDI portal
Publication:6487951
DOI10.1007/bfb0015413zbMath1512.68188MaRDI QIDQ6487951
Publication date: 21 March 2023
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)
This page was built for publication: Finding dense subgraphs
