On Hamilton decompositions of infinite circulant graphs.
Darryn E. BryantSarada HerkeBarbara M. MaenhautBridget S. WebbPublished in: J. Graph Theory (2018)
Keyphrases
- graph databases
- graph matching
- least squares
- graph theory
- graph theoretic
- singular value decomposition
- fourier transform
- iterative methods
- graph mining
- graph structure
- bipartite graph
- pattern recognition
- directed graph
- dimensionality reduction
- bayesian networks
- case study
- graph representation
- data mining
- graph data
- random graphs
- data sets