no code implementations • 10 Jun 2014 • Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar, Blair D. Sullivan
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis.
Social and Information Networks Discrete Mathematics Data Structures and Algorithms Physics and Society
