Computational Complexity of Geometric Symmetry Detection in Graphs.
Joseph ManningPublished in: Great Lakes Computer Science Conference (1989)
Keyphrases
- symmetry detection
- computational complexity
- graph theoretical
- special case
- rotational symmetry
- np complete
- graph matching
- topological information
- series parallel
- graph mining
- graph theoretic
- decision problems
- computational cost
- graph structure
- high computational complexity
- graph model
- complex structures
- computational efficiency
- geometric information
- bipartite graph
- directed graph
- graph clustering
- geometric structure
- subgraph isomorphism
- d objects
- low complexity
- np hard