Search · four archives
Search · four archives
22 papers · ranked by Valyu relevance
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…
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…
Mohsen Koohi Esfahani
We present two novel distributed CC algorithms, SiskinCC and RobinCC, which are built upon the Jayanti-Tarjan disjoint set union algorithm. To optimize memory utilization, SiskinCC and RobinCC are designed to facilitate efficient access to a shared array for all cores running in a machine. This allows execution of…
Lorenzo Di Rocco, Umberto Ferraro Petrillo, Simona E. Rombo
Background Huge amounts of molecular interaction data are continuously produced and stored in public databases. Although many bioinformatics tools have been proposed in the literature for their analysis, based on their modeling through different types of biological networks, several problems still remain unsolved when…
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…
Lorenzo Di Rocco, Umberto Ferraro Petrillo
Background Precision medicine pipelines typically begin with variant calling to identify disease-related mutations for optimal treatment selection. Reference-free approaches assess variations in the genetic profiles of distinct individuals through the utilization of a De Bruijn graph. However, the timely analysis of…
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutions in low-treewidth graphs. By "efficient" we mean that the running time has polynomial dependence on the treewidth, a linear dependence on…
Fabien Dufoulon, Shay Kutten, William K. Moses, Gopal Pandurangan + 1 more
'David Peleg'] A singularly (near) optimal distributed algorithm is one that is (near) optimal in two criteria, namely, its time and message complexities. For synchronous CON GEST networks, such algorithms are known for fundamental distributed computing problems such as leader election [Kutten et al., JACM 2015] and…
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…
Peter Sanders, Matthias Schimek
—We develop and extensively evaluate highly scalable distributed-memory algorithms for computing minimum spanning trees (MSTs). At the heart of our solutions is a scalable variant of Bor˚uvka's algorithm. For partitioned graphs with many local edges we improve this with an effective form of contracting local parts of…
Peter Sanders, Tim Niklas Uhl
—Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines. Unsurprisingly, the main issue is to reduce communication between processors. We…
Shuo Wang, Yongcai Wang, Deying Li, Qianchuan Zhao + 1 more
For a network of robots working in a specific environment, relative localization among robots is the basis for accomplishing various upper-level tasks. To avoid the latency and fragility of long-range or multi-hop communication, distributed relative localization algorithms, in which robots take local measurements and…
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…
Guohao Dou
We propose an algorithm to simulate Markovian SIS epidemics with homogeneous rates and pairwise interactions on a fixed undirected graph, assuming a distributed memory model of parallel programming and limited bandwidth. We offer an implementation of the algorithm in the form of pseudocode in the Appendix. Also, we…
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…
Christel Sirocchi, Alessandro Bogliolo
Gossip algorithms are message-passing schemes designed to compute averages and other global functions over networks through asynchronous and randomised pairwise interactions. Gossip-based protocols have drawn much attention for achieving robust and fault-tolerant communication while maintaining simplicity and…
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…
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…
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…
Uthsav Chitra, Tae Yoon Park, Benjamin J. Raphael
A standard paradigm in computational biology is to use interaction networks to analyze high-throughput biological data. Two common approaches for leveraging interaction networks are: (1) network ranking, where one ranks vertices in the network according to both vertex scores and network topology; (2) altered subnetwork…
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…