Algorithmic Complexity of Power Law Networks

DOI10.1137/1.9781611974331.ch91zbMath1394.68010arXiv1507.02426OpenAlexW2952995998MaRDI QIDQ4575673

Jakub Łącki, Paweł Brach, Marek Cygan, Piotr Sankowski

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.02426

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Greed is good for deterministic scale-free networks ⋮ Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection

This page was built for publication: Algorithmic Complexity of Power Law Networks