Author:
Alon Noga,Yuster Raphael,Zwick Uri
Reference19 articles.
1. Alon N, Goldreich O, Håstad J, Peralta R (1992) Simple constructions of almost k-wise independent random variables. Random Struct Algorithms 3(3):289–304
2. Alon N, Yuster R, Zwick U (1995) Color coding. J ACM 42:844–856
3. Alon N, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209–223
4. Björklund A, Husfeldt T (2003) Finding a path of superlogarithmic length. SIAM J Comput 32(6):1395–1402
5. Chen J, Lu S, Sze S, Zhang F (2007) Improved algorithms for path, matching, and packing problems. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms (SODA), pp 298–307
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献