Search · four archives
Search · four archives
22 papers · ranked by Valyu relevance
Lingkai Meng, Yu Shao, Long Yuan, Longbin Lai + 6 more
'Wenyuan Yu' 'Wenjie Zhang' 'Xuemin Lin' 'Jingren Zhou'] LINGKAI MENG, Antai College of Economics and Management, Shanghai Jiao Tong University, China YU SHAO, East China Normal University, China LONG YUAN∗ , Nanjing University of Science and Technology, China LONGBIN LAI, Alibaba Group, China PENG CHENG, East China…
Wilfried Yves Hamilton Adoni, Tarik Nahhal, Moez Krichen, Abdeltif El byed + 1 more
'Abdeltif El byed' 'Ismail Assayad'] Big graphs are part of the movement of “Not Only SQL” databases (also called NoSQL) focusing on the relationships between data, rather than the values themselves. The data is stored in vertices while the edges model the interactions or relationships between these data. They offer…
B. Kaan Karamete, Louaï Adhami, Eli Glaser
A distributed graph database architecture that co-exists with the distributed relational DB for I/O and atscale OLAP expression support with hundreds of PostGIS compatible geometry functions will be discussed in this article. The uniqueness of this implementation stems mainly from its double link topology structure for…
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…
Alessio Guerrieri, Alberto Montresor
—The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased. Appropriately partitioning the graph as…
Diptanshu Kakwani, Yogesh Simmhan
—Graph analytics for large scale graphs has gained interest in recent years. Many graph algorithms have been designed for vertex-centric distributed graph processing frameworks to operate on large graphs with 100 M vertices and edges, using commodity clusters and Clouds. Subgraph-centric programming models have shown…
Chaeeun Kim, Changhun Han, Ha-Myung Park, Dhananjay Singh
With a cluster of commodity hardware, how can we efficiently find all connected components of an enormous graph containing hundreds of billions of nodes and edges? The problem of finding connected components has been used in various applications such as pattern recognition, reachability indexing, graph compression…
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…
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…
Ha-Myung Park, Namyong Park, Sung-Hyon Myaeng, U Kang + 1 more
'Tatsuro Kawamoto'] A connected component in a graph is a set of nodes linked to each other by paths. The problem of finding connected components has been applied to diverse graph analysis tasks such as graph partitioning, graph compression, and pattern recognition. Several distributed algorithms have been proposed to…
Arjun Chandrasekhar, Deborah M. Gordon, Saket Navlakha
We study how the arboreal turtle ant (Cephalotes goniodontus) solves a fundamental computing problem: maintaining a trail network and finding alternative paths to route around broken links in the network. Turtle ants form a routing backbone of foraging trails linking several nests together. This species travels only in…
Robert Gmyr, Gopal Pandurangan
This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems. We consider the synchronous CONGEST distributed computing model and assume that…
Panagiotis Kostoglou, Apostolos N. Papadopoulos, Yannis Manolopoulos
Hidden graphs are flexible abstractions that are composed of a set of known vertices (nodes), whereas the set of edges are not known in advance. To uncover the set of edges, multiple edge probing queries must be executed by evaluating a function f(u, v) that returns either true or false, if nodes u and v are connected…
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…
Robert Ryan McCune, Tim Weninger, Gregory R. Madey
The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of standard machines are not well-supported by popular Big Data tools like…
Benjamin Ries, Richard J Gowers, James RB Eastwood, Irfan Alibay + 4 more
Alchemical free energy campaigns can be planned using graph theory by building up networks that contain nodes representing molecules that are connected by possible transformations as edges. We introduce Konnektor, an open-source Python package, for systematically planning, modifying, and analyzing free energy…
Tobias Røikjer, Asger Hobolth, Kasper Munch
Phase-type distributions model the time until absorption in continuous or discrete-time Markov chains on a finite state space. The multivariate phase-type distributions have diverse and important applications by modeling rewards accumulated at visited states. However, even moderately-sized state spaces make the…
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…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
Mehmet Aziz Yirik, Maria Sorokina, Christoph Steinbeck
The generation of constitutional isomer chemical spaces has been a subject of cheminformatics since the early 1960s, with applications in structure elucidation and elsewhere. In order to perform such a generation efficiently, exhaustively and isomorphism-free, the structure generator needs to ensure the building of…
Michael Hutcheon, Andrew Teale
Algorithms are presented for performing a topological analysis of an arbitrary function, evaluated on an arbitrary grid of points. These algorithms work strictly by post-processing the data and require no additional function evaluations. This is achieved by connecting the grid points with a neighbourhood graph…
Michael Hutcheon, Andrew Teale
Algorithms are presented for performing a topological analysis of an arbitrary function, evaluated on an arbitrary grid of points. These algorithms work strictly by post-processing the data and require no additional function evaluations. This is achieved by connecting the grid points with a neighbourhood graph…