Login / Signup
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Maciej Liskiewicz
Mitsunori Ogihara
Seinosuke Toda
Published in:
Theor. Comput. Sci. (2003)
Keyphrases
</>
space complexity
multi dimensional
graph mining
three dimensional
worst case
irregular isothetic grids
real time
computer vision
information systems
computational complexity
relational databases
complexity analysis