TRIANGLE COUNTING USING HDRF GRAPH PARTITION STRATEGY IN APACHE SPARK GRAPHX
Triangle counting algorithm is one of graph algorithm that can be used to analyze a graph dataset. The graph that will be analyzed sometimes needs to be partitioned first into several nodes in a cluster of graph processing engine before applying a graph algorithm to the graph. Graph partition algori...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/43524 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |