Density and power graphs in graph homomorphism problem.
Amir DaneshgarHossein HajiabolhassanPublished in: Discret. Math. (2008)
Keyphrases
- graph representation
- graph structure
- directed graph
- graph theory
- graph matching
- graph databases
- labeled graphs
- graph mining
- graph model
- graph theoretic
- weighted graph
- graph structures
- graph construction
- graph theoretical
- graph properties
- adjacency matrix
- random graphs
- graph classification
- graph clustering
- series parallel
- graph partitioning
- subgraph isomorphism
- spanning tree
- undirected graph
- dynamic graph
- graph isomorphism
- graph kernels
- graph search
- graph representations
- bipartite graph
- directed acyclic
- structural pattern recognition
- disk resident
- graph data
- planar graphs
- maximum clique
- graph drawing
- graph patterns
- inexact graph matching
- query graph
- finding the shortest path
- evolving graphs
- maximum independent set
- reachability queries
- adjacency graph
- fully connected
- connected dominating set
- association graph
- community discovery
- connected graphs
- social graphs
- maximum cardinality
- random walk
- attributed graphs
- minimum spanning tree
- topological information
- frequent subgraphs
- graph embedding
- graph transformation
- power consumption
- quasi cliques
- graph layout
- dense subgraphs
- spectral decomposition
- strongly connected
- average degree
- bounded treewidth
- small world
- web graph
- directed acyclic graph
- connected components
- real world graphs
- structured data
- maximum common subgraph
- graphical models