Graph densification
From MaRDI portal
Publication:2826070
DOI10.1145/2090236.2090266zbMath1347.68285OpenAlexW2294809513MaRDI QIDQ2826070
Madhur Tulsiani, Nikhil Srivastava, Moritz Hardt
Publication date: 7 October 2016
Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2090236.2090266
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Related Items (2)
On the Interplay Between Strong Regularity and Graph Densification ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs
Cites Work
- Unnamed Item
- The reproducible properties of correct forecasts
- The dimensions of individual strings and sequences
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- The Complexity of Forecast Testing
- The Well-Calibrated Bayesian
- Asymptotic calibration
- Dimension in Complexity Classes
- Universal prediction
- THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
This page was built for publication: Graph densification
