Generating Random Spanning Trees via Fast Matrix Multiplication
暂无分享,去创建一个
[1] Vidyadhar G. Kulkarni,et al. Generating Random Combinatorial Objects , 1990, J. Algorithms.
[2] Charles J. Colbourn,et al. Unranking and Ranking Spanning Trees of a Graph , 1989, J. Algorithms.
[3] Charles J. Colbourn,et al. Two Algorithms for Unranking Arborescences , 1996, J. Algorithms.
[4] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Aleksander Madry,et al. Fast Generation of Random Spanning Trees and the Effective Resistance Metric , 2015, SODA.
[6] Gary L. Miller,et al. A fast solver for a class of linear systems , 2012, CACM.
[7] J. Hopcroft,et al. Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .
[8] David Aldous,et al. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..
[9] Y. Peres,et al. Probability on Trees and Networks , 2017 .
[10] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[11] Neil Olver,et al. Pipage Rounding, Pessimistic Estimators and Matrix Concentration , 2013, SODA.
[12] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[13] C. D. Meyer,et al. Generalized inverses of linear transformations , 1979 .
[14] Nicholas J. A. Harvey. Algebraic Algorithms for Matching and Matroid Problems , 2009, SIAM J. Comput..
[15] Navin Goyal,et al. Expanders via random spanning trees , 2008, SODA.
[16] Aleksander Madry,et al. Faster Generation of Random Spanning Trees , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[17] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[18] Alain Guénoche. Random Spanning Tree , 1983, J. Algorithms.
[19] David Bruce Wilson,et al. Generating random spanning trees more quickly than the cover time , 1996, STOC '96.
[20] Mohit Singh,et al. A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[21] Jan Vondrák,et al. Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.