Systematic and deterministic graph minor embedding for Cartesian products of graphs.
Arman ZaribafiyanDominic J. J. MarchandSeyed Saeed Changiz RezaeiPublished in: Quantum Inf. Process. (2017)
Keyphrases
- graph embedding
- spectral embedding
- graph representation
- graph structure
- graph theory
- labeled graphs
- graph matching
- graph construction
- graph databases
- graph theoretic
- directed graph
- graph classification
- graph mining
- graph structures
- weighted graph
- adjacency matrix
- graph model
- graph properties
- subgraph isomorphism
- graph theoretical
- graph search
- spanning tree
- nodes of a graph
- graph partitioning
- graph data
- undirected graph
- vector space
- graph isomorphism
- graph clustering
- graph representations
- random graphs
- reachability queries
- connected dominating set
- bipartite graph
- graph patterns
- graph kernels
- series parallel
- connected graphs
- directed acyclic
- maximum clique
- graph transformation
- evolving graphs
- minimum spanning tree
- random walk
- maximum common subgraph
- inexact graph matching
- dynamic graph
- proximity graph
- dense subgraphs
- graph layout
- structural pattern recognition
- dimensionality reduction
- edge weights
- maximal cliques
- semi supervised
- polynomial time complexity
- disk resident
- graph drawing
- attributed graphs
- topological information
- real world graphs
- finding the shortest path
- maximum cardinality
- neighborhood graph
- bounded treewidth
- structured data
- pattern mining
- small world
- spectral methods
- planar graphs
- association graph
- vertex set
- query graph
- adjacency graph