Author:
Berenbrink Petra,Krayenhoff Bruce,Mallmann-Trenn Frederik
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference5 articles.
1. Approximating the minimum spanning tree weight in sublinear time;Chazelle;SIAM J. Comput.,2005
2. Algorithm 447: efficient algorithms for graph manipulation;Hopcroft;Commun. ACM,1973
3. Undirected connectivity in log-space;Reingold;J. ACM,2008
4. Estimating the weight of metric minimum spanning trees in sublinear-time;Czumaj,2004
5. Property testing in bounded degree graphs;Goldreich;Algorithmica,2002
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献