From quasirandom graphs to graph limits and graphlets.
Fan ChungPublished in: Adv. Appl. Math. (2014)
Keyphrases
- graph representation
- graph matching
- graph theory
- graph structure
- graph mining
- labeled graphs
- weighted graph
- adjacency matrix
- graph construction
- directed graph
- graph model
- graph classification
- subgraph isomorphism
- graph theoretic
- graph databases
- graph properties
- graph partitioning
- graph theoretical
- graph data
- random graphs
- graph structures
- graph search
- series parallel
- graph clustering
- bipartite graph
- minimum spanning tree
- graph representations
- spanning tree
- undirected graph
- random walk
- graph isomorphism
- dynamic graph
- inexact graph matching
- reachability queries
- disk resident
- graph transformation
- maximum common subgraph
- real world graphs
- structural pattern recognition
- connected dominating set
- graph edit distance
- connected graphs
- maximum independent set
- connected components
- directed acyclic
- massive graphs
- maximum cardinality
- evolving graphs
- dense subgraphs
- adjacency graph
- proximity graph
- neighborhood graph
- graph kernels
- graph layout
- topological information
- average degree
- structured data
- small world
- graph embedding
- attributed graphs
- maximum clique
- association graph
- independent set
- bounded treewidth
- maximal cliques
- social graphs
- finding the shortest path
- frequent subgraphs
- graph patterns
- spectral decomposition
- edge weights
- link prediction
- query graph
- quasi cliques
- relational graph
- graph drawing