THE COMRO ALGORITHM: AN EFFICIENT METHOD OF TRIANGLE LISTING AND COUNTING FOR HEAVYÂ TAILED DISTRIBUTION GRAPH (CASE STUDY: SOCIAL NETWORK GRAPH)
Connectivity is one of the important parameters in graph analysis, especially in social network graphs. The triangle is a fundamental metric for analyzing the connectivity of a graph. A triangle can be used to describe how close interpersonal relationships are within a community and also to represen...
Saved in:
Main Author: | Fitriyani |
---|---|
Format: | Dissertations |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/75286 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Efficient algorithms for subgraph counting and enumeration on large graphs
by: Wang, Kaixin
Published: (2024) -
TRIANGLE COUNTING USING HDRF GRAPH PARTITION STRATEGY IN APACHE SPARK GRAPHX
by: Novanto, Dicky -
COMMUNICATION-EFFICIENT DISTRIBUTED GRAPH ALGORITHMS
by: LI ER LU LAWRENCE
Published: (2021) -
On size-oriented long-tailed graph classification of graph neural networks
by: LIU, Zemin, et al.
Published: (2022) -
Learning to count isomorphisms with graph neural networks
by: YU, Xingtong, et al.
Published: (2023)