Combining Parallel Graph Rewriting and Quotient Graphs.
Thierry Boy de la TourRachid EchahedPublished in: WRLA@ETAPS (2020)
Keyphrases
- graph representation
- graph structure
- graph theory
- graph theoretic
- directed graph
- graph databases
- graph matching
- weighted graph
- graph construction
- graph mining
- rewriting rules
- labeled graphs
- graph search
- graph properties
- adjacency matrix
- graph clustering
- graph structures
- graph theoretical
- graph partitioning
- graph classification
- graph model
- rewriting systems
- graph representations
- series parallel
- random graphs
- graph kernels
- graph data
- undirected graph
- depth first search
- evolving graphs
- subgraph isomorphism
- spanning tree
- bipartite graph
- structural pattern recognition
- dynamic graph
- web graph
- real world graphs
- maximum common subgraph
- graph transformation
- directed acyclic
- random walk
- maximal cliques
- connected components
- regular path queries
- graph layout
- graph patterns
- attributed graphs
- maximum cardinality
- reachability queries
- graph isomorphism
- frequent subgraphs
- adjacency graph
- community discovery
- planar graphs
- edge weights
- inexact graph matching
- maximum clique
- connected graphs
- association graph
- vertex set
- massive graphs
- topological information
- structured data
- dense subgraphs
- social networks
- finding the shortest path
- attributed relational graph
- rewrite rules
- connected dominating set
- relational data
- community detection
- bounded degree
- proximity graph
- directed acyclic graph
- graph drawing
- polynomial time complexity
- social graphs