Cover Image

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhagat, Subhash, Pelc, Andrzej
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid
by: Gao, Younan, et al.
Published: (2024)

Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
by: Gańczorz, Adam, et al.
Published: (2024)

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

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

Min-Sum Uniform Coverage Problem by Autonomous Mobile Robots
by: Maiti, Animesh, et al.
Published: (2026)

Asynchronous BFT Asset Transfer: Quasi-Anonymous, Light, and Consensus-Free
by: Albouy, Timothé, et al.
Published: (2024)

Beeping Deterministic CONGEST Algorithms in Graphs
by: Garncarek, Pawel, et al.
Published: (2025)

Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
by: Losa, Giuliano, et al.
Published: (2024)

Exploration on Highly Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2026)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)

Semi-Synchronous Exploration in Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2026)

Fault-tolerant Consensus in Anonymous Dynamic Network
by: Zhang, Qinzi, et al.
Published: (2024)

Adaptive Self-Organization in Anonymous Dynamic Networks
by: Parzych, Garrett, et al.
Published: (2026)

Synchronization in Anonymous Networks Under Arbitrary Dynamics
by: Bazzi, Rida, et al.
Published: (2025)

On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks
by: Chaturvedi, Anya, et al.
Published: (2025)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
by: Takahashi, Shota, et al.
Published: (2025)

Self-stabilizing Graph Exploration by a Single Agent
by: Sudo, Yuichi, et al.
Published: (2020)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
by: Parzych, Garrett, et al.
Published: (2024)

Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
by: Saxena, Ashish, et al.
Published: (2025)

Flint: Compiler Enabled Cluster-Free Design Space Exploration for Distributed ML
by: Yoo, Jinsun, et al.
Published: (2026)

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

Anonymized Network Sensing using C++26 std::execution on GPUs
by: Mandulak, Michael, et al.
Published: (2025)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
by: Chalopin, Jérémie, et al.
Published: (2026)

Computing Tree Structures in Anonymous Graphs via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Softening the Impact of Collisions in Contention Resolution
by: Biswas, Umesh, et al.
Published: (2024)

Polylog-Competitive Deterministic Local Routing and Scheduling
by: Haeupler, Bernhard, et al.
Published: (2024)

Towards Optimal Deterministic LOCAL Algorithms on Trees
by: Brandt, Sebastian, et al.
Published: (2025)

Deterministic Parallel High-Quality Hypergraph Partitioning
by: Krause, Robert, et al.
Published: (2025)

Parallel Online Directed Acyclic Graph Exploration for Atlasing Soft-Matter Assembly Configuration Spaces
by: Prabhu, Rahul, et al.
Published: (2024)

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
by: Sudo, Yuichi, et al.
Published: (2026)

Deterministic Self-Stabilizing BFS Construction in Constant Space
by: Blin, Lélia, et al.
Published: (2025)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
by: Chalopin, Jérémie, et al.
Published: (2024)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
by: Chalopin, Jérémie, et al.
Published: (2024)

On the Inherent Anonymity of Gossiping
by: Guerraoui, Rachid, et al.
Published: (2023)

Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
by: Araya, Takumi, et al.
Published: (2024)

Stream-K Optimization and Exploration
by: Rackley, Nick, et al.
Published: (2024)

Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold (Extended Version)
by: Heydari, Hasan, et al.
Published: (2024)

Exploration of Energy and Throughput Tradeoffs for Dataflow Networks
by: Karim, Abrarul, et al.
Published: (2026)

Optimal Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2022)

Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
by: Goswami, Pritam, et al.
Published: (2024)