PowerLyra: differentiated graph computation and partitioning on skewed graphs.
Rong ChenJiaxin ShiYanzhe ChenHaibo ChenPublished in: EuroSys (2015)
Keyphrases
- graph partitioning
- subgraph isomorphism
- weighted graph
- spectral graph
- graph representation
- graph structure
- graph matching
- graph theory
- directed graph
- partitioning algorithm
- graph model
- vertex set
- graph databases
- graph mining
- graph theoretical
- graph theoretic
- adjacency matrix
- graph construction
- graph clustering
- labeled graphs
- graph structures
- bipartite graph
- maximum common subgraph
- graph classification
- graph properties
- random graphs
- graph data
- directed acyclic
- structural pattern recognition
- series parallel
- graph patterns
- graph kernels
- spanning tree
- graph representations
- undirected graph
- minimum spanning tree
- graph search
- graph isomorphism
- reachability queries
- graph transformation
- structured data
- attributed graphs
- dense subgraphs
- edge weights
- frequent subgraphs
- connected graphs
- normalized cut
- planar graphs
- min cut
- maximum clique
- graph drawing
- bounded degree
- random walk
- web graph
- maximal cliques
- average degree
- betweenness centrality
- dynamic graph
- adjacency graph
- spectral clustering
- graph layout
- shortest path
- community discovery
- finding the shortest path
- fully connected
- inexact graph matching
- small world