Decompositions of graphs based on a new graph product.
Antoon H. BoodeHajo BroersmaPublished in: Discret. Appl. Math. (2019)
Keyphrases
- graph representation
- graph matching
- graph theory
- graph structure
- directed graph
- weighted graph
- graph construction
- graph databases
- labeled graphs
- graph mining
- graph structures
- graph theoretic
- graph properties
- series parallel
- graph model
- graph classification
- adjacency matrix
- graph data
- graph theoretical
- graph search
- graph clustering
- graph partitioning
- reachability queries
- random graphs
- directed acyclic
- undirected graph
- structural pattern recognition
- graph representations
- subgraph isomorphism
- bipartite graph
- dense subgraphs
- graph transformation
- spanning tree
- edge weights
- inexact graph matching
- connected graphs
- graph isomorphism
- planar graphs
- dynamic graph
- graph edit distance
- maximum cardinality
- connected dominating set
- graph layout
- graph kernels
- minimum spanning tree
- community discovery
- disk resident
- evolving graphs
- connected components
- proximity graph
- structured data
- graph drawing
- maximum common subgraph
- topological information
- adjacency graph
- attributed relational graph
- maximum clique
- association graph
- finding the shortest path
- web graph
- shortest path
- small world
- massive graphs
- neighborhood graph
- fully connected
- graph embedding
- social graphs
- maximal cliques
- real world graphs