Výsledky vyhledávání - "Distributed Graph Algorithms"

Adaptive Runtime Features for Distributed Graph Algorithms Autor 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…”
Získat plný text

Distributed Graph Algorithms via Continuous Optimization Methods Autor Ye, Mingquan

“…Graph problems have been widely researched and possess a broad class of applications. The increasing large-scale graphs in various applications have…”
Získat plný text

Locality in Distributed Graph Algorithms Autor 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…”
Získat plný text

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

Získat plný text

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

Získat plný text

Efficient Distributed Graph Algorithms for High Performance Computing Contexts Autor 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…”
Získat plný text

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

Získat plný text

Local certification of graphs with bounded genus Autor 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…”
Získat plný text

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition Autor 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…”
Získat plný text

Synchronous t-resilient consensus in arbitrary graphs Autor 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…”
Získat plný text

Lower Bounds for Maximal Matchings and Maximal Independent Sets Autor 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…”
Získat plný text

Stability and Resilience of Distributed Information Spreading in Aggregate Computing Autor 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…”
Získat plný text

Towards distributed two-stage stochastic optimization Autor 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…”
Získat plný text

Redundancy in distributed proofs Autor 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…”
Získat plný text

Runtime Scheduling Policies for Distributed Graph Algorithms Autor Firoz, Jesun Sahariar, Zalewski, Marcin, Lumsdaine, Andrew, Barnas, Martina

“…In this paper we explore scheduling and runtime system support for unordered distributed graph computations that rely on optimistic (speculative) execution…”
Získat plný text

Distributed Lower Bounds for Ruling Sets Autor 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…”
Získat plný text

Property testing of planarity in the CONGEST model Autor 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…”
Získat plný text

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

“… This is achieved by leveraging the powerful algorithmic framework of Interior Point Methods (IPMs) and the Laplacian paradigm in the context of distributed graph algorithms…”
Získat plný text

A Survey of Distributed Graph Algorithms on Massive Graphs Autor Meng, Lingkai, Shao, Yu, Long, Yuan, Lai, Longbin, Cheng, Peng, Li, Xue, Yu, Wenyuan, Zhang, Wenjie, Lin, Xuemin, Zhou, Jingren

“…Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph…”
Získat plný text

MIDAS: Multilinear detection at scale Autor 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…”
Získat plný text