Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics.
Alexander D. MednykhIlya A. MednykhPublished in: Ars Math. Contemp. (2022)
Keyphrases
- markov chain
- algebraic structures
- sufficient conditions
- computational complexity
- desirable properties
- graph matching
- neural network
- graph properties
- arithmetic operations
- least squares
- computational cost
- pattern recognition
- data sets
- graphical models
- fourier transform
- structural properties
- graph theory
- graph mining
- fixed number
- graph clustering
- pairwise