Výsledky vyhľadávania - Randomised Distributed Graph Algorithm

About randomised distributed graph colouring and graph partition algorithms Autor 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…”
Získať plný text

On the time and the bit complexity of distributed randomised anonymous ring colouring Autor 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…”
Získať plný text

About Randomised Distributed Graph Colouring and Graph Partition Algorithms Autor 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…”
Získať plný text

An optimal bit complexity randomized distributed MIS algorithm Autor 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…”
Získať plný text

A nearly optimal distributed algorithm for computing the weighted girth Autor 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…”
Získať plný text

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

“…We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs…”
Získať plný text

Distributed Algorithms for Computation of Centrality Measures in Complex Networks Autor 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…”
Získať plný text

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

“… complexity.Our framework allows us to design distributed MIS algorithms that have {\mathcal{O}}({\text{polyloglog }}n) (worst-case) awake complexity in certain important graph classes which satisfy the so-called adjacency property…”
Získať plný text

Locally checkable problems in rooted trees Autor 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…”
Získať plný text

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

“… Furthermore, this study introduces a novel algorithm, distributed randomized gradient-free constrained optimization algorithm…”
Získať plný text

Sublinear Fully Distributed Partition with Applications Autor 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…”
Získať plný text

Improved distributed Δ-coloring Autor 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…”
Získať plný text

Partition-Merge: Distributed Inference and Modularity Optimization Autor 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…”
Získať plný text

Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds Autor Panconesi, Alessandro, Srinivasan, Aravind

“… We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation…”
Získať plný text

Efficient Distributed Algorithms on Random Graphs Autor Fathi, Reza

“… First, we present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs…”
Získať plný text

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

“…The authors consider distributed algorithms for approximate maximum matching on general graphs…”
Získať plný text

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

“… We present a new randomized self-stabilizing distributed algorithm…”
Získať plný text

Simple distributed Δ+1-coloring of graphs Autor Johansson, Ojvind

“…A very natural randomized algorithm for distributed vertex coloring of graphs is analyzed…”
Získať plný text

Fast Distributed Algorithms for Computing Separable Functions Autor 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…”
Získať plný text

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

“…We give a distributed randomized algorithm for graph edge colouring. Let G be a Δ…”
Získať plný text