Author:
Kanté Mamadou Moustapha,Laforest Christian,Momège Benjamin
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Ahmed, M., Lubiw, A.: Shortest paths avoiding forbidden subpaths. In: Albers, S., Marion, J.-Y. (eds.) STACS. LIPIcs, vol. 3, pp. 63–74. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
2. Bax, E.T.: Inclusion and exclusion algorithm for the hamiltonian path problem. Inf. Process. Lett. 47(4), 203–207 (1993)
3. Błażewicz, J., Kasprzak, M.: Computational complexity of isothermic dna sequencing by hybridization. Discrete Applied Mathematics 154(5), 718–729 (2006)
4. Błażewicz, J., Kasprzak, M., Leroy-Beaulieu, B., de Werra, D.: Finding hamiltonian circuits in quasi-adjoint graphs. Discrete Applied Mathematics 156(13), 2573–2580 (2008)
5. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer London Ltd. (2010)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献