Cover Image

Gathering in Non-Vertex-Transitive Graphs Under Round Robin

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cicerone, Serafino, Di Fonso, Alessia, Di Stefano, Gabriele, Navarra, Alfredo
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

An optimal algorithm for geodesic mutual visibility on hexagonal grids
by: Badri, Sahar, et al.
Published: (2024)

On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
by: Cicerone, Serafino, et al.
Published: (2025)

Oblivious Robots Under Round Robin: Gathering on Rings
by: Navarra, Alfredo, et al.
Published: (2025)

Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers
by: Flocchini, Paola, et al.
Published: (2024)

On Homomorphism Graphs
by: Brandt, Sebastian, et al.
Published: (2021)

Gathering Autonomous Mobile Robots Under the Adversarial Defected View Model
by: Shukla, Prakhar, et al.
Published: (2026)

Borel Vizing's Theorem for Graphs of Subexponential Growth
by: Bernshteyn, Anton, et al.
Published: (2023)

Min-Max Gathering on Infinite Grid
by: Chakraborty, Abhinav, et al.
Published: (2024)

Stand-Up Indulgent Gathering on Rings
by: Bramas, Quentin, et al.
Published: (2024)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
by: Fuchs, Marc, et al.
Published: (2025)

Gathering Teams of Bounded Memory Agents on a Line
by: Gao, Younan, et al.
Published: (2025)

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
by: Di Luna, Giuseppe A., et al.
Published: (2020)

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
by: Bramas, Quentin, et al.
Published: (2023)

From descriptive to distributed
by: Grebík, Jan, et al.
Published: (2025)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
by: Bernshteyn, Anton, et al.
Published: (2023)

Gathering of asynchronous robots on circle with limited visibility using finite communication
by: Sharma, Avisek, et al.
Published: (2025)

Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid
by: Gupta, Arya Tanmay, et al.
Published: (2023)

On the Universality of Round Elimination Fixed Points
by: Balliu, Alkida, et al.
Published: (2025)

Multiparty equality in the local broadcast model
by: Esperet, Louis, et al.
Published: (2025)

Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
by: Jana, Saswata, et al.
Published: (2025)

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time
by: Träff, Jesper Larsson
Published: (2023)

Spatiotemporal Traffic Prediction in Distributed Backend Systems via Graph Neural Networks
by: Qiu, Zhimin, et al.
Published: (2025)

Efficient Probabilistic Workflow Scheduling for IaaS Clouds
by: Russo, Gabriele Russo, et al.
Published: (2024)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
by: Chalopin, Jérémie, et al.
Published: (2025)

Optimality in Decentralized Optimization under Bandwidth Constraints
by: Tyurin, Alexander
Published: (2026)

Communication Round and Computation Efficient Exclusive Prefix-Sums Algorithms (for MPI_Exscan)
by: Träff, Jesper Larsson
Published: (2025)

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata
by: Baumeister, Tom, et al.
Published: (2024)

Boosting Performance of Iterative Applications on GPUs: Kernel Batching with CUDA Graphs
by: Ekelund, Jonah, et al.
Published: (2025)

Reconfigurable Holographic Surfaces and Near Field Communication for Non-Terrestrial Networks: Potential and Challenges
by: Jamshed, Muhammad Ali, et al.
Published: (2025)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
by: Chen, Jinyuan
Published: (2025)

Exploring Sparse Matrix Multiplication Kernels on the Cerebras CS-3
by: Shah, Milan, et al.
Published: (2026)

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2024)

A Parallel and Distributed Rust Library for Core Decomposition on Large Graphs
by: Rucci, Davide, et al.
Published: (2025)

A Reinforcement Learning Based Backfilling Strategy for HPC Batch Jobs
by: Kolker-Hicks, Elliot, et al.
Published: (2024)

Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling
by: Vlk, Marek, et al.
Published: (2024)

Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
by: Johnen, Colette, et al.
Published: (2024)

Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data
by: Wang, Shilong, et al.
Published: (2025)

Ephemeral Rollups are All you Need
by: Picco, Gabriele, et al.
Published: (2023)