The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.
Mitsunori OgiharaSeinosuke TodaPublished in: MFCS (2001)
Keyphrases
- polynomial time complexity
- small number
- computational complexity
- space complexity
- random graphs
- np complete
- graph matching
- maximum number
- worst case
- weighted graph
- graph representation
- database
- graph structure
- edge weights
- graph theory
- approximation error
- connected graphs
- spanning tree
- bipartite graph
- multi dimensional
- computational cost
- data structure
- three dimensional
- learning algorithm