Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Random sampling and greedy sparsification for matroid optimization problems;Karger;Math. Programming,1998
2. Proc. 34th IEEE Symp. Foundations of Computer Science;Karger,1993
3. A randomized linear-time algorithm to find minimum spanning trees;Karger;J. ACM,1995
4. Randomized Algorithms;Motwani,1995
5. Computational Geometry: An Introduction Through Randomized Algorithms;Mulmuley,1994
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
2. A cost effective graph-based partitioning algorithm for a system of linear equations;International Journal of Computational Science and Engineering;2018
3. Parallel Algorithms for Asymmetric Read-Write Costs;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
4. Randomized Minimum Spanning Tree;Encyclopedia of Algorithms;2016
5. Randomized Minimum Spanning Tree;Encyclopedia of Algorithms;2015