Suchergebnisse - "distributed graph algorithms"

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

Volltext

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

Volltext

Local certification of graphs with bounded genus von 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 …”
Volltext

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition von 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 …”
Volltext

Synchronous t-resilient consensus in arbitrary graphs von 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 …”
Volltext

Lower Bounds for Maximal Matchings and Maximal Independent Sets von 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 …”
Volltext

Stability and Resilience of Distributed Information Spreading in Aggregate Computing von 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 …”
Volltext

Redundancy in distributed proofs von 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 …”
Volltext

Towards distributed two-stage stochastic optimization von 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 …”
Volltext

Distributed Lower Bounds for Ruling Sets von 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 …”
Volltext

Property testing of planarity in the CONGEST model von 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 …”
Volltext

Minor Sparsifiers and the Distributed Laplacian Paradigm von 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 …”
Volltext

MIDAS: Multilinear detection at scale von 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 …”
Volltext

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs von 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 …”
Volltext

The topology of local computing in networks von 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 …”
Volltext

Improved distributed degree splitting and edge coloring von 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 …”
Volltext

Asynchronous Distributed Execution Of Fixpoint-Based Computational Fields von Lafuente, Alberto Lluch, Loreti, Michele, Montanari, Ugo

“… Coordination is essential for dynamic distributed systems whose components exhibit interactive and autonomous behaviors. Spatially distributed, locally …”
Volltext

Low-congestion shortcut and graph parameters von Kitamura, Naoki, Kitagawa, Hirotaka, Otachi, Yota, Izumi, Taisuke

“… Distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound of Ω ~ ( n + D ) rounds for several global problems, …”
Volltext

Fast distributed approximation for TAP and 2-edge-connectivity von Censor-Hillel, Keren, Dory, Michal

“… The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to …”
Volltext

Synchronization-Avoiding Graph Algorithms von Firoz, Jesun Sahariar, Zalewski, Marcin, Kanewala, Thejaka, Lumsdaine, Andrew

“… Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations …”
Volltext