Fetching the paper…
Reading the bibliography…
The interconnectedness and interdependence of modern graphs are growing ever more complex, causing enormous resources for processing, storage, communication, and decision-making of these graphs.
W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of anthropological research , vol. 33, no. 4, pp. 452–473, 1977
1977
Earlier work this paper cites.
L. Hubert and P. Arabie, “Comparing partitions,” Journal of classification , vol. 2, no. 1, pp. 193–218, 1985
1985
Earlier work this paper cites.
D. Peleg and J. D. Ullman, “An optimal synchronizer for the hypercube,” SIAM J. Comput. , vol. 18, no. 4, pp. 740–747, 1989
1989
Earlier work this paper cites.
C. J. C. H. Watkins, “Learning from delayed rewards,” 1989
1989
Earlier work this paper cites.
A. A. Benczúr and D. R. Karger, “Approximating s-t minimum cuts in Õ ( n 2 {}^{\mbox{2}} ) time,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing . ACM, 1996, pp. 47–55
1996
Earlier work this paper cites.
C.-S. Chang, Performance guarantees in communication networks . Springer Science & Business Media, 2000
2000
Earlier work this paper cites.
S. P. Fekete and J. Kremer, “Tree spanners in planar graphs,” Discret. Appl. Math. , vol. 108, no. 1-2, pp. 85–103, 2001
2001
Earlier work this paper cites.
Z. Wang, T. Schaul, M. Hessel, H. Hasselt, M. Lanctot, and N. Freitas, “Dueling network architectures for deep reinforcement learning,” in International conference on machine learning . PMLR, 2016, pp. 1995–2003
2003
Earlier work this paper cites.
J. L. Myers and A. D. Well, Research Design and Statistical Analysis (2nd ed.) . Lawrence Erlbaum, 2003
2003
Earlier work this paper cites.
J. Leskovec and C. Faloutsos, “Sampling from large graphs,” in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , 2006, pp. 631–636
2006
Earlier work this paper cites.
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, “Measurement and Analysis of Online Social Networks,” in Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC’07) , San Diego, CA, October 2007
2007
Earlier work this paper cites.
S. Baswana and S. Sen, “A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs,” Random Struct. Algorithms , vol. 30, no. 4, pp. 532–563, 2007
2007
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of statistical mechanics: theory and experiment , vol. 2008, no. 10, p. P10008, 2008
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
S. P. Borgatti, A. Mehra, D. J. Brass, and G. Labianca, “Network analysis in the social sciences,” science , vol. 323, no. 5916, pp. 892–895, 2009
2009
Earlier work this paper cites.
M. Bastian, S. Heymann, and M. Jacomy, “Gephi: An open source software for exploring and manipulating networks.” in ICWSM . The AAAI Press, 2009
2009
Earlier work this paper cites.
A.-L. Barabási, N. Gulbahce, and J. Loscalzo, “Network medicine: a network-based approach to human disease,” Nature reviews genetics , vol. 12, no. 1, pp. 56–68, 2011
2011
Earlier work this paper cites.
D. A. Spielman and N. Srivastava, “Graph sparsification by effective resistances,” SIAM J. Comput. , vol. 40, no. 6, pp. 1913–1926, 2011
2011
Earlier work this paper cites.
D. A. Spielman and S. Teng, “Spectral sparsification of graphs,” SIAM J. Comput. , vol. 40, no. 4, pp. 981–1025, 2011
2011
Earlier work this paper cites.
M. Mathioudakis, F. Bonchi, C. Castillo, A. Gionis, and A. Ukkonen, “Sparsification of influence networks,” in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2011, p. 529–537
2011
Earlier work this paper cites.
V. Satuluri, S. Parthasarathy, and Y. Ruan, “Local graph sparsification for scalable clustering,” in Proceedings of the ACM SIGMOD International Conference on Management of Data . ACM, 2011, pp. 721–732
2011
Cited alongside, same era.
F. F. Dragan, F. V. Fomin, and P. A. Golovach, “Spanners in sparse graphs,” J. Comput. Syst. Sci. , vol. 77, no. 6, pp. 1108–1119, 2011
2011
Cited alongside, same era.
J. Chen and I. Safro, “Algebraic distance on graphs,” SIAM Journal on Scientific Computing , vol. 33, no. 6, pp. 3468–3490, 2011
2011
Cited alongside, same era.
V. Satuluri, S. Parthasarathy, and Y. Ruan, “Local graph sparsification for scalable clustering,” ser. SIGMOD ’11. New York, NY, USA: Association for Computing Machinery, 2011, p. 721–732
2011
Cited alongside, same era.
S. Teng, “Scalable algorithms for data and network analysis,” Found. Trends Theor. Comput. Sci. , vol. 12, no. 1-2, pp. 1–274, 2016
2016
Later among the works it cites.
H. Van Hasselt, A. Guez, and D. Silver, “Deep reinforcement learning with double q-learning,” in Proceedings of the AAAI conference on artificial intelligence , vol. 30, no. 1, 2016
2016
Later among the works it cites.
V. Sadhanala, Y. Wang, and R. J. Tibshirani, “Graph sparsification approaches for laplacian smoothing,” in Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS , ser. JMLR Workshop and Conference Proceedings, vol. 51, 2016, pp. 1250–1259
2016
Later among the works it cites.
——, “Faster spectral sparsification and numerical algorithms for SDD matrices,” ACM Trans. Algorithms , vol. 12, no. 2, pp. 17:1–17:16, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
J. D. Batson, D. A. Spielman, and N. Srivastava, “Twice-ramanujan sparsifiers,” SIAM J. Comput. , vol. 41, no. 6, pp. 1704–1721, 2012
2012
Cited alongside, same era.
I. Koutis, A. Levin, and R. Peng, “Improved spectral sparsification and numerical algorithms for SDD matrices,” in 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France , ser. LIPIcs, C. Dürr and T. Wilke, Eds., vol. 14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 266–277
2012
Cited alongside, same era.
J. Leskovec and J. Mcauley, “Learning to discover social circles in ego networks,” in Advances in Neural Information Processing Systems , F. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger, Eds., vol. 25. Curran Associates, Inc., 2012
2012
Cited alongside, same era.
J. D. Batson, D. A. Spielman, N. Srivastava, and S. Teng, “Spectral sparsification of graphs: theory and algorithms,” Commun. ACM , vol. 56, no. 8, pp. 87–94, 2013
2013
Cited alongside, same era.
J. Upadhyay, “Random projections, graph sparsification, and differential privacy,” in Advances in Cryptology - ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security , vol. 8269. Springer, 2013, pp. 276–295
2013
Cited alongside, same era.
B. Nick, C. Lee, P. Cunningham, and U. Brandes, “Simmelian backbones: Amplifying hidden homophily in facebook networks,” in Proceedings of the 2013 IEEE/ACM international conference on advances in social networks analysis and mining , 2013, pp. 525–532
2013
Cited alongside, same era.
X. Zhao, Z. Feng, and C. Zhuo, “An efficient spectral graph sparsification approach to scalable reduction of large flip-chip power grids,” in The IEEE/ACM International Conference on Computer-Aided Design, ICCAD . IEEE, 2014, pp. 218–223
2014
Cited alongside, same era.
M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner, “Structure-preserving sparsification methods for social networks,” Social Network Analysis and Mining , vol. 6, no. 1, p. 22, 2016
2016
Later among the works it cites.
W. Li, D. Wolinski, and M. C. Lin, “City-scale traffic animation using statistical learning and metamodel-based optimization,” ACM Trans. Graph. , vol. 36, no. 6, pp. 200:1–200:12, Nov. 2017
2017
Later among the works it cites.
Z. Zhao and Z. Feng, “A spectral graph sparsification approach to scalable vectorless power grid integrity verification,” in Proceedings of the 54th Annual Design Automation Conference, DAC . ACM, 2017, pp. 68:1–68:6
2017
Later among the works it cites.
X. Shen, F. Chung, and S. Mao, “Leveraging cross-network information for graph sparsification in influence maximization,” in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval , 2017, pp. 801–804
2017
Later among the works it cites.
——, “An sdp-based algorithm for linear-sized spectral sparsification,” in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC . ACM, 2017, pp. 678–687
2017
Later among the works it cites.
2017
Later among the works it cites.
H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, “Local higher-order graph clustering,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . Association for Computing Machinery, 2017, p. 555–564
2017
Later among the works it cites.
A. P. Iyer, A. Panda, S. Venkataraman, M. Chowdhury, A. Akella, S. Shenker, and I. Stoica, “Bridging the gap: Towards approximate graph analytics,” in Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) , 2018
2018
Later among the works it cites.
D. Calandriello, I. Koutis, A. Lazaric, and M. Valko, “Improved large-scale graph learning through ridge spectral sparsification,” in Proceedings of the 35th International Conference on Machine Learning, ICML , vol. 80, 2018, pp. 687–696
2018
Later among the works it cites.
L. Lin, W. Li, and S. Peeta, “Efficient data collection and accurate travel time estimation in a connected vehicle environment via real-time compressive sensing,” Journal of Big Data Analytics in Transportation , vol. 1, no. 2, pp. 95–107, 2019
2019
Later among the works it cites.
W. S. Fung, R. Hariharan, N. J. A. Harvey, and D. Panigrahi, “A general framework for graph sparsification,” SIAM J. Comput. , vol. 48, no. 4, pp. 1196–1223, 2019
2019
Later among the works it cites.
R. Arora and J. Upadhyay, “On differentially private graph sparsification and applications,” in Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems, NeurIPS , 2019, pp. 13 378–13 389
2019
Later among the works it cites.
L. Wang, W. Yu, W. Wang, W. Cheng, W. Zhang, H. Zha, X. He, and H. Chen, “Learning robust representations with graph denoising policy network,” in 2019 IEEE International Conference on Data Mining (ICDM) . IEEE, 2019, pp. 1378–1383
2019
Later among the works it cites.
H.-Y. Wu and Y.-L. Chen, “Graph sparsification with generative adversarial network,” 2020
2020
Later among the works it cites.
V.-A. Darvariu, S. Hailes, and M. Musolesi, “Improving the robustness of graphs through reinforcement learning and graph neural networks,” 2020
2020
Later among the works it cites.
C. Zheng, B. Zong, W. Cheng, D. Song, J. Ni, W. Yu, H. Chen, and W. Wang, “Robust graph representation learning via neural sparsification,” in International Conference on Machine Learning . PMLR, 2020, pp. 11 458–11 468
2020
Later among the works it cites.