Image de couverture de livre

Location-Aware Dispersion on Anonymous Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Himani, Pandit, Supantha, Sharma, Gokarna
Format:	Preprint
Publié:	2026
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Multiagent Systems Robotics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dispersion is (Almost) Optimal under (A)synchrony
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Optimal Dispersion Under Asynchrony
par: Pattanayak, Debasish, et autres
Publié: (2025)

Agentic Distributed Computing
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Agent-based Leader Election, MST, and Beyond
par: Kshemkalyani, Ajay D., et autres
Publié: (2024)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
par: Cosson, Romain, et autres
Publié: (2025)

Asynchronous Gathering of Opaque Robots with Mobility Faults
par: Pramanick, Subhajit, et autres
Publié: (2025)

A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
par: Dutta, Ayan, et autres
Publié: (2016)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
par: Bai, Sirui, et autres
Publié: (2024)

On the Power of Spatial Locality on Online Routing Problems
par: Guragain, Swapnil, et autres
Publié: (2025)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
par: Zhang, Yunqi, et autres
Publié: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
par: Akker, Erik van den, et autres
Publié: (2024)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
par: Flin, Maxime, et autres
Publié: (2024)

DiRAC - Distributed Robot Awareness and Consensus
par: Gopan, Uday, et autres
Publié: (2025)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

Computing in Anonymous Dynamic Networks Is Linear
par: Di Luna, Giuseppe A., et autres
Publié: (2022)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
par: Pourdamghani, Arash, et autres
Publié: (2024)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Round and Communication Efficient Graph Coloring
par: Chang, Yi-Jun, et autres
Publié: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
par: Chang, Yi-Jun, et autres
Publié: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
par: Latypov, Rustam, et autres
Publié: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

Online Load and Graph Balancing for Random Order Inputs
par: Im, Sungjin, et autres
Publié: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
par: Lechowicz, Adam, et autres
Publié: (2023)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
par: Sanders, Peter, et autres
Publié: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
par: Bonamy, Marthe, et autres
Publié: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
par: Boneh, Itai, et autres
Publié: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
par: Lenzen, Christoph, et autres
Publié: (2024)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
par: Dindoost, Mohammad, et autres
Publié: (2025)

Computing Tree Structures in Anonymous Graphs via Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
par: Gaur, Gaurav, et autres
Publié: (2025)

DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
par: Islam, Abdullah Al Raqibul, et autres
Publié: (2024)

Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planning
par: Li, Qingbiao, et autres
Publié: (2020)