Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs.
Arman ZaribafiyanDominic J. J. MarchandSeyed Saeed Changiz RezaeiPublished in: CoRR (2016)
Keyphrases
- graph embedding
- spectral embedding
- graph representation
- graph structure
- weighted graph
- directed graph
- labeled graphs
- graph construction
- graph theory
- graph classification
- graph theoretic
- graph matching
- graph databases
- graph structures
- graph clustering
- graph model
- nodes of a graph
- graph properties
- random graphs
- adjacency matrix
- graph search
- graph data
- graph mining
- graph theoretical
- graph partitioning
- series parallel
- subgraph isomorphism
- graph kernels
- spanning tree
- graph isomorphism
- minimum spanning tree
- undirected graph
- vector space
- dynamic graph
- random walk
- graph representations
- maximum common subgraph
- inexact graph matching
- disk resident
- reachability queries
- graph transformation
- maximal cliques
- proximity graph
- graph patterns
- edge weights
- maximum clique
- connected graphs
- bipartite graph
- dense subgraphs
- social graphs
- adjacency graph
- planar graphs
- structural pattern recognition
- finding the shortest path
- maximum cardinality
- low dimensional
- graph drawing
- association graph
- attributed graphs
- neighborhood graph
- small world
- web graph
- dimensionality reduction
- community discovery
- spectral methods
- quasi cliques
- pattern mining
- structured data
- connected dominating set