Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. A. Bogdanov, Kenji Obata, L. Trevisan, A lower bound for testing 3-colorability in bounded-degree graphs, in: Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science, 2002, pp. 93–102
2. Approximating the minimum spanning tree weight in sublinear time;Chazelle;SIAM Journal on Computing,2005
3. Elements of Information Theory;Cover,1991
4. A. Czumaj, C. Sohler, Estimating the weight of metric minimum spanning trees in sublinear time, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing, 2004, pp. 175–183
5. A. Czumaj, C. Sohler, Sublinear-time approximation for clustering via random sampling, in: Automata, Languages and Programming: Thirty-First International Colloquium, 2004, pp. 396–407
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献