The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs
Mitsunori OgiharaSeinosuke TodaPublished in: Electron. Colloquium Comput. Complex. (2001)
Keyphrases
- small number
- polynomial time complexity
- computational complexity
- random graphs
- computational cost
- graph matching
- graph theory
- graph mining
- graph model
- three dimensional
- series parallel
- connected graphs
- representational power
- graph construction
- small world
- maximum number
- complex structures
- undirected graph
- spanning tree
- graph databases