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

2003/03/26 by Maciej Liśkiewicz, Mitsunori Ogihara, Seinosuke Toda · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems

paper · pdf · doi:10.1016/s0304-3975(03)00080-x

openalex publication_date 2003/03/26 · crossref created 2003/03/26 · crossref issued 2003/07/01 · crossref published 2003/07/01 · crossref published-print 2003/07/01 · crossref deposited 2024/12/11 · openalex created_date 2025/10/10 · crossref indexed 2026/04/06 · openalex updated_date 2026/08/03

Citations

• A note on succinct representations of graphs
• The Complexity of Enumeration and Reliability Problems

Cited by

• List of unsolved problems in mathematics [wikipedia]