Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference28 articles.
1. Finding a path of superlogarithmic length;Björklund;SIAM J. Comput.,2003
2. On computing a longest path in a tree;Bulterman;Inf. Process. Lett.,2002
3. Finding paths and cycles of superpolylogarithmic length;Gabow;SIAM J. Comput.,2007
4. Gabow, H. N., Nie, S., 2008. Finding long paths, cycles and circuits. Proceedings of the 19th Annual International Symposium on Algorithms and Computation, S-H Hong. In: Nagamochi, H., Fukunaga, T. (Eds.), Lecture Notes in Computer Science 5369. Springer-Verlag, pp. 752–763.
5. Computers and Intractability: A guide to the Theory of NP-Completeness;Garey,1979
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献