Cover Image

Semi-Synchronous Exploration in Dynamic Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Saxena, Ashish, Molla, Anisur Rahaman, Mondal, Kaushik, Sharma, Gokarna
Format:	Preprint
Published:	2026
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

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

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

Balanced Dispersion on Time-Varying Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2024)

Black Hole Search in Dynamic Graphs
by: Kaur, Tanvir, et al.
Published: (2024)

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
by: Sadhukhan, Abhijit, et al.
Published: (2026)

Optimizing Robot Dispersion on Grids: with and without Fault Tolerance
by: Banerjee, Rik, et al.
Published: (2024)

Optimal Fault-Tolerant Dispersion on Oriented Grids
by: Banerjee, Rik, et al.
Published: (2024)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

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

Black Hole Search: Dynamics, Distribution, and Emergence
by: Kaur, Tanvir, et al.
Published: (2026)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

Distributed Butterfly Analysis using Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
by: Chand, Prabhat Kumar, et al.
Published: (2024)

Consensus Through Knot Discovery in Asynchronous Dynamic Networks
by: Bricker, Rachel, et al.
Published: (2024)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

When Agents are Powerful: Black Hole Search with Verification in Time-Varying Graphs
by: Kaur, Tanvir, et al.
Published: (2025)

BeRGeR: Byzantine-Robust Geometric Routing
by: Zaz, Brown, et al.
Published: (2024)

Optimal Uniform Circle Formation by Asynchronous Luminous Robots
by: Feletti, Caterina, et al.
Published: (2024)

SmartShards: Churn-Tolerant Continuously Available Distributed Ledger
by: Oglio, Joseph, et al.
Published: (2025)

Transforming Lock-free Linked Lists into Distributed Lock-free Linked Lists
by: Ravishankar, Raaghav, et al.
Published: (2025)

TRAIL: Cross-Shard Validation for Cryptocurrency Byzantine Shard Protection
by: Jacovetty, Mitch, et al.
Published: (2024)

Distributing Context-Aware Shared Memory Data Structures: A Case Study on Singly-Linked Lists
by: Ravishankar, Raaghav, et al.
Published: (2024)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
by: Kaur, Tanvir, et al.
Published: (2024)

When Can You Trust Bitcoin? Value-Dependent Block Confirmation to Determine Transaction Finalit
by: Hicks, Ethan, et al.
Published: (2025)

Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)

Computational Power of Mobile Robots in Synchronous Environment: Discrete Version
by: Sharma, Avisek, et al.
Published: (2024)

Optimal Dispersion of Silent Robots in a Ring
by: Das, Bibhuti, et al.
Published: (2024)

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

Asynchronous Gathering of Opaque Robots with Mobility Faults
by: Pramanick, Subhajit, et al.
Published: (2025)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
by: Bhagat, Subhash, et al.
Published: (2024)

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)

Time Optimal Distance-$k$-Dispersion on Dynamic Ring
by: Mondal, Brati, et al.
Published: (2024)

Synchronous Consensus in Partial Synchrony
by: Klianev, Ivan
Published: (2023)

Multi-Factor Trust-Driven Secure Communication Model for Cloud-Based Digital Twins
by: Saxena, Deepika, et al.
Published: (2026)

A Self-Healing and Fault-Tolerant Cloud-based Digital Twin Processing Management Model
by: Saxena, Deepika, et al.
Published: (2025)

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

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