Search Results - Randomised Distributed Graph Algorithm*

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…”
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…”
Get full text

About Randomised Distributed Graph Colouring and Graph Partition Algorithms by Métivier, Yves, Robson, John Michael, Saheb-Djahromi, Nasser, Zemmari, Akka

“…We present and analyse a very simple randomised distributed vertex colouring algorithm for arbitrary graphs of size $n…”
Get full text

An optimal bit complexity randomized distributed MIS algorithm by Métivier, Y., Robson, J. M., Saheb-Djahromi, N., Zemmari, A.

“…We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O (log n…”
Get full text

A nearly optimal distributed algorithm for computing the weighted girth by Hua, Qiang-Sheng, Qian, Lixiang, Yu, Dongxiao, Shi, Xuanhua, Jin, Hai

“… In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, n c…”
Get full text

Distributed Algorithms for Computation of Centrality Measures in Complex Networks by Keyou You, Tempo, Roberto, Li Qiu

“… Regarding eigenvector centrality, we consider the PageRank problem as its typical variant, and design distributed randomized algorithms to compute PageRank for both fixed and time-varying graphs…”
Get full text

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs by Chatterjee, Soumyottam, Fathi, Reza, Pandurangan, Gopal, Pham, Nguyen Dinh

“…We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs…”
Get full text

Awake-Efficient Distributed Algorithms for Maximal Independent Set by Hourani, Khalid, Pandurangan, Gopal, Robinson, Peter

“…We present a simple algorithmic framework for designing efficient distributed algorithms for the fundamental symmetry breaking problem of Maximal Independent Set (MIS…”
Get full text

Locally checkable problems in rooted trees by Balliu, Alkida, Brandt, Sebastian, Chang, Yi-Jun, Olivetti, Dennis, Studený, Jan, Suomela, Jukka, Tereshchenko, Aleksandr

“… (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set…”
Get full text

Improved distributed Δ-coloring by Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic

“…We present a randomized distributed algorithm that computes a Δ -coloring in any non-complete graph with maximum degree Δ ≥ 4 in O ( log Δ ) + 2 O ( log log n…”
Get full text

Empire of colonies: Self-stabilizing and self-organizing distributed algorithm by Dolev, Shlomi, Tzachar, Nir

“… We present a new randomized self-stabilizing distributed algorithm…”
Get full text

Distributed Randomized Gradient-Free Convex Optimization With Set Constraints Over Time-Varying Weight-Unbalanced Digraphs by Zhu, Yanan, Li, Qinghai, Li, Tao, Wen, Guanghui

“… Furthermore, this study introduces a novel algorithm, distributed randomized gradient-free constrained optimization algorithm…”
Get full text

Sublinear Fully Distributed Partition with Applications by Derbel, Bilel, Mosbah, Mohamed, Zemmari, Akka

“…We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k −1 and having O ( n 1+1/ k ) intercluster edges…”
Get full text

Efficient Distributed Algorithms on Random Graphs by Fathi, Reza

“… First, we present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs…”
Get full text

Distributed Approximate Matching by Lotker, Zvi, Patt-Shamir, Boaz, Rosén, Adi

“…The authors consider distributed algorithms for approximate maximum matching on general graphs…”
Get full text

On efficient distributed construction of near optimal routing schemes by Elkin, Michael, Neiman, Ofer

“…Given a distributed network represented by a weighted undirected graph G = ( V , E ) on n vertices, and a parameter k , we devise a randomized distributed algorithm that whp computes a routing scheme in O…”
Get full text

Partition-Merge: Distributed Inference and Modularity Optimization by Blondel, Vincent, Jung, Kyomin, Kohli, Pushmeet, Shah, Devavrat, Won, Seungpil

“…This paper presents a novel meta-algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster…”
Get full text

Near-optimal, distributed edge colouring via the nibble method by Dubhashi, Devdatt, Grable, David A., Panconesi, Alessandro

“…We give a distributed randomized algorithm for graph edge colouring. Let G be a Δ…”
Get full text

Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs by Dinitz, Yefim, Dolev, Shlomi, Kumar, Manish

“… ) for the running time bound in the dynamic setting, where n is the number of nodes in the graph, is known even for randomized algorithms…”
Get full text

Fast Distributed Algorithms for Computing Separable Functions by Mosk-Aoyama, D., Shah, D.

“…The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information…”
Get full text