Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes.
Mikhail E. MuzychukGottfried TinhoferPublished in: Electron. J. Comb. (2001)
Keyphrases
- graph isomorphism
- bounded treewidth
- special case
- polynomial time complexity
- planar graphs
- graph matching
- computational complexity
- graph theory
- least squares
- automatic recognition
- graph clustering
- fourier transform
- condition number
- worst case
- graph model
- graph databases
- graph theoretic
- clustering algorithm
- series parallel
- np complete
- data representations
- graph search
- weighted graph
- directed graph
- bipartite graph
- approximation algorithms