Hamiltonian path problem (English Wikipedia)

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

refsWebsite

Global rank English rank

18doi.org

2^nd place

4psu.edu

207^th place

136^th place

3worldcat.org

5^th place

3semanticscholar.org

11^th place

8^th place

3arxiv.org

69^th place

59^th place

3ams.org

451^st place

277^th place

2springer.com

274^th place

309^th place

2stackexchange.com

1,983^rd place

1,330^th place

1siam.org

low place

6,473^rd place

1harvard.edu

18^th place

17^th place

1jstor.org

26^th place

20^th place

1nih.gov

4^th place

1aya.or.jp

low place

1skatgame.net

low place

1archive.org

6^th place

1bu.edu

2,120^th place

1,328^th place

1utoronto.ca

1,601^st place

1,117^th place

1uci.edu

3,063^rd place

2,041^st place

1web.dev

low place

1stonybrook.edu

9,697^th place

6,089^th place

ams.org (Global: 451^st place; English: 277^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.

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: 69^th place; English: 59^th 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,120^th place; English: 1,328^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), Lin, Guohui (ed.), "An Improved Exact Algorithm for Cubic Graph TSP", 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.
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.
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.
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.
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.

harvard.edu (Global: 18^th place; English: 17^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.

jstor.org (Global: 26^th place; English: 20^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.

nih.gov (Global: 4^th place; English: 4^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.

psu.edu (Global: 207^th place; English: 136^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.
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.
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.
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.

semanticscholar.org (Global: 11^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: low place; English: 6,473^rd 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.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Iwama, Kazuo; Nakashima, Takuya (2007), Lin, Guohui (ed.), "An Improved Exact Algorithm for Cubic Graph TSP", 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: 1,983^rd place; English: 1,330^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,697^th place; English: 6,089^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: 3,063^rd place; English: 2,041^st place)

newport.eecs.uci.edu

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

utoronto.ca (Global: 1,601^st place; English: 1,117^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: 5^th place; English: 5^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)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

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

arxiv.org (Global: 69th place; English: 59th place)

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

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

cs-people.bu.edu

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

doi.org

dx.doi.org

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

jstor.org (Global: 26th place; English: 20th place)

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

pubmed.ncbi.nlm.nih.gov

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

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

api.semanticscholar.org

siam.org (Global: low place; English: 6,473rd place)

epubs.siam.org

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

springer.com (Global: 274th place; English: 309th place)

link.springer.com

stackexchange.com (Global: 1,983rd place; English: 1,330th place)

math.stackexchange.com

cs.stackexchange.com

stonybrook.edu (Global: 9,697th place; English: 6,089th place)

www3.cs.stonybrook.edu

uci.edu (Global: 3,063rd place; English: 2,041st place)

newport.eecs.uci.edu

utoronto.ca (Global: 1,601st place; English: 1,117th place)

utsc.utoronto.ca

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

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

search.worldcat.org

ams.org (Global: 451^st place; English: 277^th place)

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

arxiv.org (Global: 69^th place; English: 59^th place)

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

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

harvard.edu (Global: 18^th place; English: 17^th place)

jstor.org (Global: 26^th place; English: 20^th place)

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

psu.edu (Global: 207^th place; English: 136^th place)

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

siam.org (Global: low place; English: 6,473^rd place)

springer.com (Global: 274^th place; English: 309^th place)

stackexchange.com (Global: 1,983^rd place; English: 1,330^th place)

stonybrook.edu (Global: 9,697^th place; English: 6,089^th place)

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

utoronto.ca (Global: 1,601^st place; English: 1,117^th place)

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