Search Results - "Distributed Graph Algorithm"

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

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

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

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

“…We present a simple deterministic distributed algorithm that computes a ( \Delta+1 )-vertex coloring in O(\text{log}^{2}\Delta. \text{log}\ n) rounds. The…”
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

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) communication rounds; here n is the number…”
Get full text

Stability and Resilience of Distributed Information Spreading in Aggregate Computing by Mo, Yuanqiu, Dasgupta, Soura, Beal, Jacob

“…Spreading informationthrough a network of devices is a core activity for most distributed systems. Self-stabilizing algorithms for information spreading are…”
Get full text

Redundancy in distributed proofs by Feuilloley, Laurent, Fraigniaud, Pierre, Hirvonen, Juho, Paz, Ami, Perry, Mor

“…Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the…”
Get full text

Towards distributed two-stage stochastic optimization by Emek, Yuval, Harlev, Noga, Izumi, Taisuke

“…The weighted vertex cover problem revolves around selecting a subset of vertices that covers a target edge set while minimizing the total cost of the selected…”
Get full text

Distributed Lower Bounds for Ruling Sets by Balliu, Alkida, Brandt, Sebastian, Olivetti, Dennis

“…Given a graph G=(V, E) , an ( \alpha,\beta ) -ruling set is a subset S\subseteq V such that the distance between any two vertices in S is at least \alpha , and…”
Get full text

Property testing of planarity in the CONGEST model by Levi, Reut, Medina, Moti, Ron, Dana

“…We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following…”
Get full text

Minor Sparsifiers and the Distributed Laplacian Paradigm by Forster, Sebastian, Goranci, Gramoz, Liu, Yang P., Peng, Richard, Sun, Xiaorui, Ye, Mingquan

“…We study distributed algorithms built around minor-based vertex sparsifiers, and give the first algorithm in the CONGEST model for solving linear systems in…”
Get full text

MIDAS: Multilinear detection at scale by Ekanayake, Saliya, Cadena, Jose, Wickramasinghe, Udayanga, Vullikanti, Anil

“…We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are…”
Get full text

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs by Czygrinow, A., Hanćkowiak, M., Szymańska, E., Wawrzyniak, W., Witkowski, M.

“…In this paper we consider the 2-dominating set problem (2MDS). We look for a smallest subset of vertices D⊆V with the property that every vertex in V∖D is…”
Get full text

The topology of local computing in networks by Fraigniaud, Pierre, Paz, Ami

“…For more than three decades, distributed systems have been described and analyzed using topological tools, primarily using two techniques: protocol complexes…”
Get full text

Improved distributed degree splitting and edge coloring by Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic, Suomela, Jukka, Uitto, Jara

“…The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a…”
Get full text