Counting Self-Avoiding Walks: Open-Loop Algorithm and the Complexity of the Brute-Force Approach
P. Mazur · 2005
We have investigated the problem of constructing parallel algorithms for counting self-avoiding walks and we present new algorithm called Open-Loop Algorithm. We have also worked on the complexity of the brute-force algorithm. The research allowed us to find some features of self-avoiding walks and to advance two hypotheses: one about the existence of 6 constant and one about its connection with : (connective constant). Also some remarks about programming with OpenMP and Sun's C compiler are made.