Author:
Chen Guantao,Gao Zhicheng,Yu Xingxing,Zang Wenan
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Björklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM J. Comput. 32, 1395–1402 (2003)
2. Chen, G., Xu, J., Yu, X.: Circumference of graphs with bounded degree. SIAM J. Comput. 33, 1136–1170 (2004)
3. Feder, T., Motwani, R., Subi, C.: Approximating the longest cycle problem in sparse graphs. SIAM J. Comput. 31, 1596–1607 (2002)
4. Feder, T., Motwani, R.: Finding a long cycle in a graph with a degree bound and a 3-cyclable minor. Manuscript (2004)
5. Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. In: Proc. 36th annual ACM symposium on Theory of Computing (STOC), Chicago, pp. 407–416 (2004)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献