Name
Abstract | ||
|---|---|---|
This article presents SAWdoubler, a package for counting the total number ZN of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic concept has been published previously by us. We discuss an algorithm for the creation of all SAWs of length N, efficient storage of these SAWs in a tree data structure, and an algorithm for the computation of correction terms to the count Z2N for SAWs of double length, removing all combinations of two intersecting single-length SAWs. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cpc.2012.10.026 | Computer Physics Communications |
Keywords | Field | DocType |
Self-avoiding walk,Enumeration,Simple cubic lattice | Self-avoiding walk,Numbering,Square lattice,Mathematical analysis,Computer science,Algorithm,Compiler,Computational science,Event loop,Test data,Speedup,Computation | Journal |
Volume | Issue | ISSN |
184 | 3 | 0010-4655 |
Citations | PageRank | References |
2 | 0.44 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raoul D. Schram | 1 | 3 | 0.83 |
| Gerard T. Barkema | 2 | 36 | 3.24 |
| Rob H. Bisseling | 3 | 540 | 45.77 |