ITM Web Conf.
Volume 25, 20192018 3rd International Conference on Intelligent Computing and Cognitive Informatics (ICICCI 2018)
|Number of page(s)||4|
|Published online||01 February 2019|
Analysing Big Social Graphs Using a List-based Graph Folding Algorithm
Southern Federal University, Department of Computer Engineering, Taganrog, Russia
2 Southern Federal University, Department of Information Security Systems, Taganrog, Russia
a Corresponding author: firstname.lastname@example.org
In this paper, we explore the ways to represent big social graphs using adjacency lists and edge lists. Furthermore, we describe a list-based algorithm for graph folding that makes possible to analyze conditionally infinite social graphs on resource constrained mobile devices. The steps of the algorithm are (a) to partition, in a certain way, the graph into clusters of different levels, (b) to represent each cluster of the graph as an edge list, and (c) to absorb the current cluster by the cluster of the next level. The proposed algorithm is illustrated by the example of a sparse social graph.
© The Authors, published by EDP Sciences, 2019
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.