VERTEX-CUT PARTITIONING PERFORMANCE ANALYSIS FOR FASTCD ALGORITHM IN LARGE-SCALE GRAPH
<p align="justify">Rapid processing of large-scale graphs has become a popular research topic on domains such as graph partitioning and community detection. This research discusses the performance of vertex-cut partitioning for the processing of community detection on large-scale gra...
Saved in:
Main Author: | RUSDIWIJAYA - NIM: 23515060 , RIZKI |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/30596 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
PARALLEL FACETNET ALGORITHM WITH VERTEX CUT TECHNIQUE AS A METHOD FOR COMMUNITY EVOLUTION DETECTION ON THE BIG GRAPH
by: Atastina, Imelda -
Improving large graph processing on partitioned graphs in the cloud
by: Chen, Rishan, et al.
Published: (2013) -
STRONGLY VERTEX-MAGIC GRAPHS
by: HENG HUI ZHEN
Published: (2021) -
VERTEX-MAGIC REGULAR GRAPHS
by: TANG WANWEI SHERYL
Published: (2021) -
VERTEX MAGIC LABELING OF GRAPHS
by: SWATI GUPTA
Published: (2021)