Hardness results for isomorphism and automorphism of bounded valence graphs.
Fabian WagnerPublished in: SOFSEM (2) (2008)
Keyphrases
- graph isomorphism
- graph theory
- subgraph isomorphism
- graph search
- np complete
- bounded treewidth
- graph matching
- graph mining
- graph theoretic
- graph databases
- learning theory
- computational models
- computational complexity
- np hard
- graph partitioning
- undirected graph
- neural network
- spanning tree
- weighted graph
- graph representation
- graph structure
- graph data
- graph clustering
- worst case
- complex networks
- directed graph
- series parallel
- labeled graphs
- similarity measure