Continual and Cost-Effective Partitioning of Dynamic Graphs for Optimizing Big Graph Processing Systems.
Amirreza AbdolrashidiLakshmish RamaswamyPublished in: BigData Congress (2016)
Keyphrases
- cost effective
- low cost
- dynamic graph
- graph partitioning
- graph structure
- directed graph
- graph theory
- graph representation
- series parallel
- cost effectiveness
- dynamic networks
- weighted graph
- graph data
- graph mining
- graph model
- real time
- graph databases
- graph theoretic
- random walk
- graph matching
- connected components
- structural pattern recognition
- spanning tree
- reachability queries
- labeled graphs
- partitioning algorithm
- graph structures
- graph search
- graph theoretical
- planar graphs
- subgraph isomorphism
- topological information
- graph classification
- graph construction
- random graphs