Enumerating Unique Computational Graphs via an Iterative Graph Invariant.
Chris YingPublished in: CoRR (2019)
Keyphrases
- graph representation
- graph theory
- graph construction
- graph structure
- graph matching
- directed graph
- graph databases
- weighted graph
- labeled graphs
- graph model
- graph theoretic
- graph mining
- graph classification
- adjacency matrix
- graph structures
- graph properties
- series parallel
- graph partitioning
- subgraph isomorphism
- graph theoretical
- graph search
- structural pattern recognition
- graph kernels
- undirected graph
- random graphs
- graph clustering
- graph transformation
- graph isomorphism
- bipartite graph
- dynamic graph
- spanning tree
- adjacency graph
- disk resident
- graph data
- maximal cliques
- graph edit distance
- average degree
- inexact graph matching
- reachability queries
- maximum common subgraph
- dense subgraphs
- directed acyclic
- real world graphs
- connected dominating set
- maximum clique
- graph representations
- web graph
- vertex set
- evolving graphs
- maximum cardinality
- graph patterns
- graph layout
- spectral decomposition
- random walk
- topological information
- dominating set
- polynomial time complexity
- query graph
- social graphs
- minimum spanning tree
- maximum independent set
- small world
- edge weights
- finding the shortest path
- graph embedding
- community discovery
- bounded treewidth
- degree distribution