"The complexity of counting self-avoiding walks in subgraphs of ..."

Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda (2003)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(03)00080-X

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/LiskiewiczOT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LiskiewiczOT03
Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda:
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304(1-3): 129-156 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.