The Densest Subgraph Problem with a Convex/Concave Size Function
From MaRDI portal
Publication:4636527
DOI10.4230/LIPICS.ISAAC.2016.44zbMath1398.05122OpenAlexW2577502779MaRDI QIDQ4636527
Yasushi Kawase, Atsushi Miyauchi
Publication date: 19 April 2018
Full work available at URL: https://dblp.uni-trier.de/db/conf/isaac/isaac2016.html#KawaseM16a
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Density (toughness, etc.) (05C42)
Related Items (1)
This page was built for publication: The Densest Subgraph Problem with a Convex/Concave Size Function