The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs

Mitsunori Ogihara, Seinosuke Toda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Fingerprint Dive into the research topics of 'The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science