Hamiltonian path problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hamiltonian path problem" in English language version.

Last modified: 15:57:02, 8 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2018doi.org

2^nd place

44psu.edu

299^th place

159^th place

43worldcat.org

4^th place

33semanticscholar.org

15^th place

8^th place

33arxiv.org

49^th place

31^st place

33ams.org

434^th place

249^th place

31bu.edu

2,348^th place

1,348^th place

22springer.com

182^nd place

172^nd place

22stackexchange.com

4,114^th place

3,027^th place

11siam.org

9,070^th place

5,832^nd place

11adsabs.harvard.edu

14^th place

9^th place

11jstor.org

23^rd place

15^th place

11nih.gov

5^th place

11aya.or.jp

low place

11skatgame.net

low place

11archive.org

6^th place

11utoronto.ca

1,483^rd place

930^th place

11uci.edu

4,152^nd place

2,592^nd place

11web.dev

low place

11stonybrook.edu

9,832^nd place

5,790^th place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Adleman, Leonard (November 1994), "Molecular computation of solutions to combinatorial problems", Science, 266 (5187): 1021–1024, Bibcode:1994Sci...266.1021A, CiteSeerX 10.1.1.54.2565, doi:10.1126/science.7973651, JSTOR 2885489, PMID 7973651 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.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 0596313.
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, vol. 3, pp. 259–268, doi:10.1016/S0167-5060(08)70511-9, ISBN 9780720408430, MR 0499124.
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, CiteSeerX 10.1.1.321.7008, doi:10.1016/S0022-0000(05)80063-7, MR 1279412 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

archive.org (Global: 6^th place; English: 6^th place)

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, vol. 3, pp. 259–268, doi:10.1016/S0167-5060(08)70511-9, ISBN 9780720408430, MR 0499124.

arxiv.org (Global: 49^th place; English: 31^st place)

Bjorklund, Andreas (October 2010). "Determinant Sums for Undirected Hamiltonicity". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE. pp. 173–182. arXiv:1008.0541. doi:10.1109/focs.2010.24. ISBN 978-1-4244-8525-3.
Mihai Oltean (2006). A light-based device for solving the Hamiltonian path problem. Unconventional Computing. Springer LNCS 4135. pp. 217–227. arXiv:0708.1496. doi:10.1007/11839132_18.
Schmid, Andreas; Schmidt, Jens M. (2018), "Computing Tutte Paths", Proceedings of the 45th International Colloquium on Automata, Languages and Programming (ICALP'18), to appear.

aya.or.jp (Global: low place; English: low place)

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

bu.edu (Global: 2,348^th place; English: 1,348^th place)

cs-people.bu.edu

Bun, Mark (November 2022). "Boston University Theory of Computation" (PDF).

doi.org (Global: 2^nd place; English: 2^nd place)

doi.org

Held, M.; Karp, R. M. (1965). "The construction of discrete dynamic programming algorithms". IBM Systems Journal. 4 (2): 136–147. doi:10.1147/sj.42.0136. ISSN 0018-8670.
Rubin, Frank (1974), "A Search Procedure for Hamilton Paths and Circuits", Journal of the ACM, 21 (4): 576–80, doi:10.1145/321850.321854, S2CID 7132716
Bellman, Richard (January 1962). "Dynamic Programming Treatment of the Travelling Salesman Problem". Journal of the ACM. 9 (1): 61–63. doi:10.1145/321105.321111. ISSN 0004-5411. S2CID 15649582.
Held, Michael; Karp, Richard M. (March 1962). "A Dynamic Programming Approach to Sequencing Problems". Journal of the Society for Industrial and Applied Mathematics. 10 (1): 196–210. doi:10.1137/0110015. ISSN 0368-4245.
Bjorklund, Andreas (October 2010). "Determinant Sums for Undirected Hamiltonicity". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE. pp. 173–182. arXiv:1008.0541. doi:10.1109/focs.2010.24. ISBN 978-1-4244-8525-3.
Iwama, Kazuo; Nakashima, Takuya (2007), "An Improved Exact Algorithm for Cubic Graph TSP", in Lin, Guohui (ed.), Computing and Combinatorics, Lecture Notes in Computer Science, vol. 4598, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 108–117, doi:10.1007/978-3-540-73545-8_13, ISBN 978-3-540-73544-1, retrieved 2023-10-07
Adleman, Leonard (November 1994), "Molecular computation of solutions to combinatorial problems", Science, 266 (5187): 1021–1024, Bibcode:1994Sci...266.1021A, CiteSeerX 10.1.1.54.2565, doi:10.1126/science.7973651, JSTOR 2885489, PMID 7973651 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Mihai Oltean (2006). A light-based device for solving the Hamiltonian path problem. Unconventional Computing. Springer LNCS 4135. pp. 217–227. arXiv:0708.1496. doi:10.1007/11839132_18.
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, S2CID 207693360.
Plesńik, J. (1979), "The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two" (PDF), Information Processing Letters, 8 (4): 199–201, doi:10.1016/0020-0190(79)90023-1.
Itai, Alon; Papadimitriou, Christos; Szwarcfiter, Jayme (1982), "Hamilton Paths in Grid Graphs", SIAM Journal on Computing, 4 (11): 676–686, CiteSeerX 10.1.1.383.1078, doi:10.1137/0211056 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Buro, Michael (2001), "Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs" (PDF), Computers and Games, Lecture Notes in Computer Science, vol. 2063, pp. 250–261, CiteSeerX 10.1.1.40.9731, doi:10.1007/3-540-45579-5_17, ISBN 978-3-540-43080-3 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Chiba, Norishige; Nishizeki, Takao (1989), "The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs", Journal of Algorithms, 10 (2): 187–211, doi:10.1016/0196-6774(89)90012-6
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, vol. 3, pp. 259–268, doi:10.1016/S0167-5060(08)70511-9, ISBN 9780720408430, MR 0499124.
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, CiteSeerX 10.1.1.321.7008, doi:10.1016/S0022-0000(05)80063-7, MR 1279412 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Satish, E. G. (2022). "Comparative Performance Analysis of Routing Topology for NoC Architecture". Emerging Research in Computing, Information, Communication and Applications. Lecture Notes in Electrical Engineering. Vol. 790. pp. 431–440. doi:10.1007/978-981-16-1342-5_34. ISBN 978-981-16-1341-8 – via Springer.

dx.doi.org

Held, M.; Karp, R. M. (1965). "The construction of discrete dynamic programming algorithms". IBM Systems Journal. 4 (2): 136–147. doi:10.1147/sj.42.0136. ISSN 0018-8670.
Bjorklund, Andreas (October 2010). "Determinant Sums for Undirected Hamiltonicity". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE. pp. 173–182. arXiv:1008.0541. doi:10.1109/focs.2010.24. ISBN 978-1-4244-8525-3.

jstor.org (Global: 23^rd place; English: 15^th place)

Adleman, Leonard (November 1994), "Molecular computation of solutions to combinatorial problems", Science, 266 (5187): 1021–1024, Bibcode:1994Sci...266.1021A, CiteSeerX 10.1.1.54.2565, doi:10.1126/science.7973651, JSTOR 2885489, PMID 7973651 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

nih.gov (Global: 5^th place; English: 5^th place)

pubmed.ncbi.nlm.nih.gov

Adleman, Leonard (November 1994), "Molecular computation of solutions to combinatorial problems", Science, 266 (5187): 1021–1024, Bibcode:1994Sci...266.1021A, CiteSeerX 10.1.1.54.2565, doi:10.1126/science.7973651, JSTOR 2885489, PMID 7973651 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Adleman, Leonard (November 1994), "Molecular computation of solutions to combinatorial problems", Science, 266 (5187): 1021–1024, Bibcode:1994Sci...266.1021A, CiteSeerX 10.1.1.54.2565, doi:10.1126/science.7973651, JSTOR 2885489, PMID 7973651 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Itai, Alon; Papadimitriou, Christos; Szwarcfiter, Jayme (1982), "Hamilton Paths in Grid Graphs", SIAM Journal on Computing, 4 (11): 676–686, CiteSeerX 10.1.1.383.1078, doi:10.1137/0211056 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Buro, Michael (2001), "Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs" (PDF), Computers and Games, Lecture Notes in Computer Science, vol. 2063, pp. 250–261, CiteSeerX 10.1.1.40.9731, doi:10.1007/3-540-45579-5_17, ISBN 978-3-540-43080-3 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
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, CiteSeerX 10.1.1.321.7008, doi:10.1016/S0022-0000(05)80063-7, MR 1279412 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.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, S2CID 7132716
Bellman, Richard (January 1962). "Dynamic Programming Treatment of the Travelling Salesman Problem". Journal of the ACM. 9 (1): 61–63. doi:10.1145/321105.321111. ISSN 0004-5411. S2CID 15649582.
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, S2CID 207693360.

siam.org (Global: 9,070^th place; English: 5,832^nd place)

epubs.siam.org

Held, Michael; Karp, Richard M. (March 1962). "A Dynamic Programming Approach to Sequencing Problems". Journal of the Society for Industrial and Applied Mathematics. 10 (1): 196–210. doi:10.1137/0110015. ISSN 0368-4245.

skatgame.net (Global: low place; English: low place)

Buro, Michael (2001), "Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs" (PDF), Computers and Games, Lecture Notes in Computer Science, vol. 2063, pp. 250–261, CiteSeerX 10.1.1.40.9731, doi:10.1007/3-540-45579-5_17, ISBN 978-3-540-43080-3 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Iwama, Kazuo; Nakashima, Takuya (2007), "An Improved Exact Algorithm for Cubic Graph TSP", in Lin, Guohui (ed.), Computing and Combinatorics, Lecture Notes in Computer Science, vol. 4598, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 108–117, doi:10.1007/978-3-540-73545-8_13, ISBN 978-3-540-73544-1, retrieved 2023-10-07
Satish, E. G. (2022). "Comparative Performance Analysis of Routing Topology for NoC Architecture". Emerging Research in Computing, Information, Communication and Applications. Lecture Notes in Electrical Engineering. Vol. 790. pp. 431–440. doi:10.1007/978-981-16-1342-5_34. ISBN 978-981-16-1341-8 – via Springer.

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

math.stackexchange.com

Reduction from Hamiltonian cycle to Hamiltonian path

cs.stackexchange.com

"Proof that the existence of a Hamilton Path in a bipartite graph is NP-complete". Computer Science Stack Exchange. Retrieved 2019-03-18.

stonybrook.edu (Global: 9,832^nd place; English: 5,790^th place)

www3.cs.stonybrook.edu

Arkin, Esther M.; Mitchell, Joseph S. B.; Held, Martin; Skiena, Steven S. "Hamiltonian Triangulations for Fast Rendering" (PDF). Department of Computer Science Stony Brook University.

uci.edu (Global: 4,152^nd place; English: 2,592^nd place)

newport.eecs.uci.edu

Bahn, Jun Ho. "Overview of Network-on-Chip". University Of California Irvine.

utoronto.ca (Global: 1,483^rd place; English: 930^th place)

utsc.utoronto.ca

Bretscher, A (February 5, 2021). "University of Toronto CSCC63 Week 7 Lecture Notes" (PDF).

web.dev (Global: low place; English: low place)

Garsiel, Tali; Irish, Paul (August 5, 2011). "How Browsers Work".

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Held, M.; Karp, R. M. (1965). "The construction of discrete dynamic programming algorithms". IBM Systems Journal. 4 (2): 136–147. doi:10.1147/sj.42.0136. ISSN 0018-8670.
Bellman, Richard (January 1962). "Dynamic Programming Treatment of the Travelling Salesman Problem". Journal of the ACM. 9 (1): 61–63. doi:10.1145/321105.321111. ISSN 0004-5411. S2CID 15649582.
Held, Michael; Karp, Richard M. (March 1962). "A Dynamic Programming Approach to Sequencing Problems". Journal of the Society for Industrial and Applied Mathematics. 10 (1): 196–210. doi:10.1137/0110015. ISSN 0368-4245.

Hamiltonian path problem (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

aya.or.jp (Global: low place; English: low place)

bu.edu (Global: 2,348th place; English: 1,348th place)

cs-people.bu.edu

doi.org (Global: 2nd place; English: 2nd place)

doi.org

dx.doi.org

jstor.org (Global: 23rd place; English: 15th place)

nih.gov (Global: 5th place; English: 5th place)

pubmed.ncbi.nlm.nih.gov

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

siam.org (Global: 9,070th place; English: 5,832nd place)

epubs.siam.org

skatgame.net (Global: low place; English: low place)

springer.com (Global: 182nd place; English: 172nd place)

link.springer.com

stackexchange.com (Global: 4,114th place; English: 3,027th place)

math.stackexchange.com

cs.stackexchange.com

stonybrook.edu (Global: 9,832nd place; English: 5,790th place)

www3.cs.stonybrook.edu

uci.edu (Global: 4,152nd place; English: 2,592nd place)

newport.eecs.uci.edu

utoronto.ca (Global: 1,483rd place; English: 930th place)

utsc.utoronto.ca

web.dev (Global: low place; English: low place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ams.org (Global: 434^th place; English: 249^th place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

bu.edu (Global: 2,348^th place; English: 1,348^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

jstor.org (Global: 23^rd place; English: 15^th place)

nih.gov (Global: 5^th place; English: 5^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

siam.org (Global: 9,070^th place; English: 5,832^nd place)

springer.com (Global: 182^nd place; English: 172^nd place)

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

stonybrook.edu (Global: 9,832^nd place; English: 5,790^th place)

uci.edu (Global: 4,152^nd place; English: 2,592^nd place)

utoronto.ca (Global: 1,483^rd place; English: 930^th place)

worldcat.org (Global: 4^th place; English: 4^th place)