Improving large graph processing on partitioned graphs in the cloud.
Rishan ChenMao YangXuetian WengByron ChoiBingsheng HeXiaoming LiPublished in: SoCC (2012)
Keyphrases
- graph theory
- directed graph
- graph structure
- graph representation
- graph matching
- graph construction
- labeled graphs
- graph theoretic
- weighted graph
- adjacency matrix
- graph partitioning
- graph databases
- graph mining
- graph theoretical
- series parallel
- graph search
- undirected graph
- graph model
- graph isomorphism
- graph structures
- graph classification
- graph data
- bipartite graph
- graph properties
- subgraph isomorphism
- random graphs
- graph representations
- graph clustering
- graph drawing
- spanning tree
- random walk
- reachability queries
- structural pattern recognition
- graph patterns
- graph transformation
- dense subgraphs
- maximum clique
- polynomial time complexity
- maximum independent set
- evolving graphs
- inexact graph matching
- planar graphs
- fully connected
- edge weights
- graph kernels
- structured data
- web graph
- bounded treewidth
- community discovery
- disk resident
- query graph
- directed acyclic
- minimum spanning tree
- dynamic graph
- graph layout
- neighborhood graph
- topological information
- association graph