Graph Attribution Through Sub-Graphs.
Harmen KastenbergArend RensinkPublished in: Graph Transformation, Specifications, and Nets (2018)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph theoretic
- graph matching
- graph structure
- graph databases
- graph construction
- graph mining
- weighted graph
- labeled graphs
- graph structures
- graph clustering
- graph theoretical
- graph classification
- adjacency matrix
- graph model
- graph search
- random graphs
- series parallel
- undirected graph
- graph partitioning
- bipartite graph
- graph data
- structural pattern recognition
- graph properties
- subgraph isomorphism
- graph isomorphism
- reachability queries
- graph kernels
- graph edit distance
- maximum common subgraph
- connected graphs
- graph representations
- dynamic graph
- graph layout
- connected dominating set
- average degree
- graph transformation
- web graph
- directed acyclic
- disk resident
- maximum independent set
- planar graphs
- maximal cliques
- evolving graphs
- maximum cardinality
- inexact graph matching
- graph patterns
- adjacency graph
- edge weights
- spectral decomposition
- massive graphs
- dense subgraphs
- graph drawing
- minimum spanning tree
- strongly connected
- independent set
- neighborhood graph
- fully connected
- vertex set
- community discovery
- attributed graphs
- random walk
- dominating set
- structured data
- topological information
- complex networks
- connected components
- link prediction
- bounded degree
- proximity graph
- polynomial time complexity
- small world
- bounded treewidth