Greed is Good for Deterministic Scale-Free Networks.
DOI10.4230/LIPIcs.FSTTCS.2016.33zbMath1393.68130arXiv1610.04217OpenAlexW2533436956MaRDI QIDQ4636581
Tobias Friedrich, Ralf Rothenberger, Ankit Chauhan
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1610.04217
random graphsindependent setdominating setapproximation algorithmsvertex coverscale-free networkspower-law degree distributionPLB networks
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Greed is Good for Deterministic Scale-Free Networks.