Search · four archives
Search · four archives
10 papers · ranked by Valyu relevance
Miguel E. Coimbra, Alexandre P. Francisco, Luís Veiga
The value of graph-based big data can be unlocked by exploring the topology and metrics of the networks they represent, and the computational approaches to this exploration take on many forms. For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one…
Amin Sahebi, Marco Barbone, Marco Procaccini, Wayne Luk + 2 more
'Georgi Gaydadjiev' 'Roberto Giorgi'] Processing large-scale graphs is challenging due to the nature of the computation that causes irregular memory access patterns. Managing such irregular accesses may cause significant performance degradation on both CPUs and GPUs. Thus, recent research trends propose graph…
Chiwan Park, Ha-Myung Park, U. Kang, Roland Bouffanais
How can we analyze large graphs such as the Web, and social networks with hundreds of billions of vertices and edges? Although many graph mining systems have been proposed to perform various graph mining algorithms on such large graphs, they have difficulties in processing Web-scale graphs due to massive communication…
Jie Cao, Haoxiang Wang, Jingru Jiao, Kekun Hu + 1 more
With the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However, conventional graph partitioning methods predominantly rely on…
Erfan Farhangi Maleki, Nasser Ghadiri, Maryam Lotfi Shahreza, Zeinab Maleki
Heterogeneous complex networks are large graphs consisting of different types of nodes and edges. The process of mining and knowledge extraction from these networks is so complicated. Moreover, the scale of these networks is steadily increasing. Thus, scalable methods are required. In this paper, two distributed label…
Peng Zhang, Wenzhang Dou, Huaping Liu
Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph structure. Such design originated from the fact that any two nodes…
Jordan K. Matelsky, Erik C. Johnson, Brock Wester, William Gray-Roncal
Neuroscientists now have the opportunity to analyze synaptic resolution connectomes that are larger than the memory on single consumer workstations. As dataset size and tissue diversity have grown, there is increasing interest in conducting comparative connectomics research, including rapidly querying and searching for…
Haotian Li
Machine learning and deep learning are novel and trending approaches to solving real-world scientific problems. Graph machine learning is dedicated to performing learning methods, such as graph neural networks, on non-Euclidean data such as graphs. Molecules, with their natural graph structures, could be analyzed by…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Sabuzima Nayak, Ripon Patgiri
Big Graph is a graph having thousands of vertices and hundreds of thousands of edges. The study of graphs is crucial because the interlinkage among the vertices provides various insights and uncovers the hidden truth developed due to their relationship. The graph processing has non-linear time complexity. The…