Specifying graph languages with type graphs.
Andrea CorradiniBarbara KönigDennis NoltePublished in: J. Log. Algebraic Methods Program. (2019)
Keyphrases
- graph theory
- graph representation
- graph structure
- graph matching
- weighted graph
- directed graph
- graph databases
- graph theoretic
- adjacency matrix
- graph construction
- graph clustering
- graph data
- graph model
- graph mining
- graph classification
- graph partitioning
- graph theoretical
- bipartite graph
- random graphs
- labeled graphs
- graph structures
- graph properties
- graph kernels
- subgraph isomorphism
- graph isomorphism
- series parallel
- structural pattern recognition
- type checking
- reachability queries
- minimum spanning tree
- expressive power
- graph layout
- graph search
- directed acyclic
- maximum common subgraph
- connected dominating set
- evolving graphs
- inexact graph matching
- maximum clique
- random walk
- graph representations
- spanning tree
- undirected graph
- maximal cliques
- structured data
- maximum independent set
- maximum cardinality
- massive graphs
- neighborhood graph
- dense subgraphs
- dynamic graph
- real world graphs
- topological information
- attributed graphs
- disk resident
- edge weights
- connected graphs
- structured objects
- bounded degree
- graph drawing
- fully connected
- planar graphs
- finding the shortest path
- query graph
- connected components