↓ Skip to main content
What is this page? Embed badge

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

Overview of attention for article published in Theoretical Computer Science, July 2003
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (92nd percentile)
  • High Attention Score compared to outputs of the same age and source (88th percentile)

Mentioned by

wikipedia
6 Wikipedia pages
reddit
1 Redditor
q&a
4 Q&A threads

Readers on

mendeley
19 Mendeley
citeulike
1 CiteULike
So far, Altmetric has seen 6 citations on 6 Wikipedia pages.
This page shows the most recent Wikipedia articles that mention this research output. Click here to find out how to access more activity, including 2 additional Wikipedia articles.