Search Results - "Distributed graph algorithm"

An Examination of a Symmetric Memory Model's Impact on Performance in a Distributed Graph Algorithm by Ing, Michael C

“…Over the last few decades, Message Passing Interface (MPI) has become the parallel-communication standard for distributed algorithms on high-performance…”
Get full text

A distributed graph algorithm for the detection of local cycles and knots by Boukerche, A., Tropper, C.

“…In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. The algorithm distinguishes between cycles and knots and is the…”
Get full text

On the time and the bit complexity of distributed randomised anonymous ring colouring by Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.

“…We present and analyse a very simple randomised distributed vertex colouring algorithm for ring graphs. Its time complexity is log2n+o(logn) on average and…”
Get full text

About randomised distributed graph colouring and graph partition algorithms by Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.

“…We present and analyse a very simple randomised distributed vertex colouring algorithm for arbitrary graphs of size n that halts in time O ( log n ) with…”
Get full text

A general distributed graph algorithm for fair access to critical sections by Santoro, Nicola, Gafni, Eli

Get full text

An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs by Ding, Yihua, Wang, James Z, srimani, Pradip K

“…Given a connected graph G=(V, E) (without any isolates), a set {\mathcal {S}} \subseteqV is a total dominating set if each node i\inV is adjacent to at least…”
Get full text

A distributed approach to weighted frequent Subgraph mining by Babu, Nisha, John, Ansamma

“…In various application domains like Social Network Analysis, cheminformatics etc, graph based data representations are used to effectively represent the…”
Get full text

A GENERAL DISTRIBUTED GRAPH ALGORITHM FOR FAIR ACCESS TO CRITICAL SECTIONS by Santoro, Nicola, Gafni, Eli

“…We deal with the following problems: Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has…”
Get full text

Adaptive Runtime Features for Distributed Graph Algorithms by Firoz, Jesun Sahariar, Zalewski, Marcin, Suetterlein, Joshua, Lumsdaine, Andrew

“…Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages…”
Get full text

Distributed Graph Algorithms via Continuous Optimization Methods by Ye, Mingquan

“…Graph problems have been widely researched and possess a broad class of applications. The increasing large-scale graphs in various applications have…”
Get full text

Locality in Distributed Graph Algorithms by Linial, Nathan

“…This paper concerns a number of algorithmic problems on graphs and how they may be solved in a distributed fashion. The computational model is such that each…”
Get full text

Distributed Graph Algorithms for Multiple Vector Engines of NEC SX-Aurora TSUBASA Systems

Get full text

The energy complexity of diameter and minimum cut computation in bounded-genus networks by Chang, Yi-Jun

Get full text

Efficient Distributed Graph Algorithms for High Performance Computing Contexts by Bogle, Ian

“…There exists a rich and long-standing body of literature on the topic of efficient, parallel graph algorithms. For many problems, an optimal shared memory…”
Get full text

Distributed half-integral matching and beyond by Dahal, Sameep, Suomela, Jukka

Get full text

Local certification of graphs with bounded genus by Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan

“…Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed…”
Get full text

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition by Ghaffari, Mohsen, Kuhn, Fabian

“… )-vertex coloring had remained a central open question in the area of distributed graph algorithms since the 1980s, until a recent network decomposition algorithm of Rozhoň and Ghaffari [STOC'20…”
Get full text

Synchronous t-resilient consensus in arbitrary graphs by Castañeda, Armando, Fraigniaud, Pierre, Paz, Ami, Rajsbaum, Sergio, Roy, Matthieu, Travers, Corentin

“…We study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly…”
Get full text

Introduction to local certification by Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output…”
Get full text

Lower Bounds for Maximal Matchings and Maximal Independent Sets by Balliu, Alkida, Brandt, Sebastian, Hirvonen, Juho, Olivetti, Dennis, Rabie, Mikael, Suomela, Jukka

“…There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O(Δ + log^* n…”
Get full text