Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. Fast probabilistic algorithms for Hamiltonian circuits and matchings;Angluin;J. Comput. System Sci.,1979
2. Finding a path of superlogarithmic length;Bjorklund;SIAM J. Comput.,2003
3. A. Bjorklund, T. Husfeldt, S. Khanna, Approximating longest directed path, Electronic Colloquium on Computational Complexity, Report No. 32, 2003
4. Finding hidden Hamilton cycles;Broder;Random Structures Algorithms,1994
5. C. Bailey-Kellog, S. Chainraj, G. Pandurangan, A random graph approach for NMR sequential assignment, in: Proc. 8th Annual Internat. Conf. on Research in Computational Molecular Biology (RECOMB), 2004
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献