Problema del camino Hamiltoniano (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema del camino Hamiltoniano" in Spanish language version.

refsWebsite

Global rank Spanish rank

10doi.org

2^nd place

3ams.org

451^st place

1,294^th place

1arxiv.org

69^th place

148^th place

1jstor.org

26^th place

56^th place

1nih.gov

4^th place

1aya.or.jp

low place

1tohoku.ac.jp

9,956^th place

low place

1web.archive.org

1^st place

ams.org

Akiyama, Takanori; Nishizeki, Takao; Saito, Nobuji (1980––1981), «NP-completeness of the Hamiltonian cycle problem for bipartite graphs», Journal of Information Processing 3 (2): 73-76, MR 596313 . (enlace roto disponible en Internet Archive; véase el historial, la primera versión y la última)..
Thomason, A. G. (1978), «Hamiltonian cycles and uniquely edge colourable graphs», Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics 3, pp. 259-268, ISBN 9780720408430, MR 499124, doi:10.1016/S0167-5060(08)70511-9 ..
Papadimitriou, Christos H. (1994), «On the complexity of the parity argument and other inefficient proofs of existence», Journal of Computer and System Sciences 48 (3): 498-532, MR 1279412, doi:10.1016/S0022-0000(05)80063-7 ..

arxiv.org

Björklund, Andreas (2010), «Determinant sums for undirected Hamiltonicity», Proc. 51st IEEE Symposium on Foundations of Computer Science (FOCS '10), pp. 173-182, ISBN 978-1-4244-8525-3, arXiv:1008.0541, doi:10.1109/FOCS.2010.24 ..

aya.or.jp

Plesńik, J. (1979), «The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two», Information Processing Letters 8 (4): 199-201, doi:10.1016/0020-0190(79)90023-1 ..

doi.org

dx.doi.org

Rubin, Frank (1974), «A Search Procedure for Hamilton Paths and Circuits», Journal of the ACM 21 (4): 576-80, doi:10.1145/321850.321854 ..
Bellman, R. (1962), «Dynamic programming treatment of the travelling salesman problem», Journal of the ACM 9: 61-63, doi:10.1145/321105.321111 ..
Held, M.; Karp, R. M. (1962), «A dynamic programming approach to sequencing problems», J. Siam 10 (1): 196-210, doi:10.1137/0110015 ..
Björklund, Andreas (2010), «Determinant sums for undirected Hamiltonicity», Proc. 51st IEEE Symposium on Foundations of Computer Science (FOCS '10), pp. 173-182, ISBN 978-1-4244-8525-3, arXiv:1008.0541, doi:10.1109/FOCS.2010.24 ..
Iwama, Kazuo; Nakashima, Takuya (2007), «An improved exact algorithm for cubic graph TSP», Proc. 13th Annual International Conference on Computing and Combinatorics (COCOON 2007), Lecture Notes in Computer Science 4598, pp. 108-117, ISBN 978-3-540-73544-1, doi:10.1007/978-3-540-73545-8_13 ..
Adleman, Leonard (November), «Molecular computation of solutions to combinatorial problems», Science 266 (5187): 1021-1024, JSTOR 2885489, PMID 7973651, doi:10.1126/science.7973651 ..
Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), «Some simplified NP-complete problems», Proc. 6th ACM Symposium on Theory of Computing (STOC '74), pp. 47-63, doi:10.1145/800119.803884 ..
Plesńik, J. (1979), «The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two», Information Processing Letters 8 (4): 199-201, doi:10.1016/0020-0190(79)90023-1 ..
Thomason, A. G. (1978), «Hamiltonian cycles and uniquely edge colourable graphs», Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics 3, pp. 259-268, ISBN 9780720408430, MR 499124, doi:10.1016/S0167-5060(08)70511-9 ..
Papadimitriou, Christos H. (1994), «On the complexity of the parity argument and other inefficient proofs of existence», Journal of Computer and System Sciences 48 (3): 498-532, MR 1279412, doi:10.1016/S0022-0000(05)80063-7 ..

jstor.org

Adleman, Leonard (November), «Molecular computation of solutions to combinatorial problems», Science 266 (5187): 1021-1024, JSTOR 2885489, PMID 7973651, doi:10.1126/science.7973651 ..

nih.gov

ncbi.nlm.nih.gov

Adleman, Leonard (November), «Molecular computation of solutions to combinatorial problems», Science 266 (5187): 1021-1024, JSTOR 2885489, PMID 7973651, doi:10.1126/science.7973651 ..

tohoku.ac.jp

nishizeki.ecei.tohoku.ac.jp

Akiyama, Takanori; Nishizeki, Takao; Saito, Nobuji (1980––1981), «NP-completeness of the Hamiltonian cycle problem for bipartite graphs», Journal of Information Processing 3 (2): 73-76, MR 596313 . (enlace roto disponible en Internet Archive; véase el historial, la primera versión y la última)..

web.archive.org

Akiyama, Takanori; Nishizeki, Takao; Saito, Nobuji (1980––1981), «NP-completeness of the Hamiltonian cycle problem for bipartite graphs», Journal of Information Processing 3 (2): 73-76, MR 596313 . (enlace roto disponible en Internet Archive; véase el historial, la primera versión y la última)..