Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints (Q1203237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints |
scientific article; zbMATH DE number 111971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints |
scientific article; zbMATH DE number 111971 |
Statements
Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints (English)
0 references
27 September 1994
0 references
pivot algorithm
0 references
critical exponent
0 references
0 references
0.90082467
0 references
0.8740613
0 references
0.8618731
0 references
0 references
0.84958494
0 references
0.84855646
0 references
0.84570986
0 references
0.84476304
0 references
0.84392864
0 references
0 references
